DocumentCode :
1567201
Title :
Proceedings 33rd Annual Symposium on Foundations of Computer Science (Cat. No.92CH3188-0)
fYear :
1992
Abstract :
The following topics were dealt with: theorem proving; computational geometry; group theory; parallel processing; formal languages; load balancing; computational complexity; circuit complexity; matrix algebra; scheduling; decidability; optimisation; learning; multiprocessor interconnection; and graph theory
Keywords :
computational complexity; computational geometry; formal languages; graph theory; multiprocessor interconnection networks; parallel algorithms; circuit complexity; computational complexity; computational geometry; decidability; formal languages; graph theory; group theory; learning; load balancing; matrix algebra; multiprocessor interconnection; optimisation; parallel processing; scheduling; theorem proving;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location :
Pittsburgh, PA, USA
Print_ISBN :
0-8186-2900-2
Type :
conf
DOI :
10.1109/SFCS.1992.267825
Filename :
267825
Link To Document :
بازگشت