DocumentCode :
3325171
Title :
Proceedings 38th Annual Symposium on Foundations of Computer Science
fYear :
1997
fDate :
20-22 Oct. 1997
Abstract :
The following topics were dealt with: graph theory; algebra; computability; automata theory; temporal logic; trees; computational geometry; randomised algorithms; computational complexity; communication complexity; cryptography; multiprocessor interconnection networks; and machine learning
Keywords :
computational complexity; algebra; automata theory; communication complexity; computability; computational complexity; computational geometry; cryptography; graph theory; machine learning; multiprocessor interconnection networks; randomised algorithms; temporal logic; trees;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
Conference_Location :
Miami Beach, FL, USA
ISSN :
0272-5428
Print_ISBN :
0-8186-8197-7
Type :
conf
DOI :
10.1109/SFCS.1997.646084
Filename :
646084
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3325171
بازگشت