Property 
Value 
dbo:abstract

 In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The aim of the computational number theory is to study the most relevant algorithm from the number theory. (en)
 In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry.Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and postquantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and SwinnertonDyer conjecture, the ABC conjecture, the modularity conjecture, the SatoTate conjecture, and explicit aspects of the Langlands program. (en)

dbo:wikiPageEditLink
 
dbo:wikiPageExternalLink
 
dbo:wikiPageExtracted

 20200113 22:59:07Z (xsd:date)
 20200525 09:06:16Z (xsd:date)
 20200609 22:41:42Z (xsd:date)

dbo:wikiPageHistoryLink
 
dbo:wikiPageID
 
dbo:wikiPageLength

 5589 (xsd:integer)
 6344 (xsd:integer)

dbo:wikiPageModified

 20200113 22:59:06Z (xsd:date)
 20200525 09:06:13Z (xsd:date)
 20200609 22:41:39Z (xsd:date)

dbo:wikiPageOutDegree

 33 (xsd:integer)
 39 (xsd:integer)

dbo:wikiPageRevisionID

 935658511 (xsd:integer)
 958707565 (xsd:integer)
 961697725 (xsd:integer)

dbo:wikiPageRevisionLink
 
dbp:wikiPageUsesTemplate
 
dct:subject
 
rdfs:comment

 In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The aim of the computational number theory is to study the most relevant algorithm from the number theory. (en)
 In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry.Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and postquantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and SwinnertonDyer conjecture, the ABC conjecture, the modularity conjecture, the SatoTate conjecture, and explicit aspects of the Langlands program. (en)

rdfs:label

 Computational number theory (en)

owl:sameAs
 
foaf:isPrimaryTopicOf
 
is dbo:academicDiscipline
of  
is dbo:knownFor
of  
is dbo:wikiPageRedirects
of  
is foaf:primaryTopic
of  