DocumentCode :
2179984
Title :
Succinct certificates for the solvability of binary quadratic Diophantine equations
Author :
Lagarias, Jeffrey C.
fYear :
1979
fDate :
29-31 Oct. 1979
Firstpage :
47
Lastpage :
54
Keywords :
Complexity theory; Computational complexity; Cryptography; Equations; Length measurement; Polynomials; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1979., 20th Annual Symposium on
Conference_Location :
San Juan, Puerto Rico
ISSN :
0272-5428
Type :
conf
DOI :
10.1109/SFCS.1979.40
Filename :
4568000
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2179984
