DocumentCode :
2111334
Title :
Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
fYear :
1996
fDate :
24-27 May 1996
Abstract :
The following topics were dealt with: computational complexity; circuit complexity; parallel complexity; randomness; VC dimension; set theory; weak completeness; functions; integer programming; graph theory; and NP complete problems
Keywords :
circuit theory; computational complexity; integer programming; parallel algorithms; programming theory; set theory; NP complete problems; VC dimension; circuit complexity; computational complexity; functions; graph theory; integer programming; parallel complexity; randomness; set theory; weak completeness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on
Conference_Location :
Philadelphia, PA, USA
Print_ISBN :
0-8186-7386-9
Type :
conf
DOI :
10.1109/CCC.1996.507662
Filename :
507662
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2111334
بازگشت