DocumentCode :
2177468
Title :
Diophantine complexity
Author :
Adleman, Leonard ; Manders, Kenneth
fYear :
1976
fDate :
25-27 Oct. 1976
Firstpage :
81
Lastpage :
88
Keywords :
Computational complexity; Computational modeling; Computer interfaces; Computer science; Costs; Laboratories; Logic; Polynomials; Time measurement; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1976., 17th Annual Symposium on
Conference_Location :
Houston, TX, USA
ISSN :
0272-5428
Type :
conf
DOI :
10.1109/SFCS.1976.13
Filename :
4567891
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2177468
بازگشت