DocumentCode
2200917
Title
Proceedings of 1993 IEEE 8th Annual Conference on Structure in Complexity Theory
fYear
1993
fDate
18-21 May 1993
Abstract
The following topics are dealt with: uncheatable benchmarks; complexity classes; computational complexity; polynomial-time optimization; p-selective sets; NP-complete problems; isomorphisms; circuit complexity; Boolean functions; oracles; counting classes; reducibility; sparse sets; formal language theory; PRAMs; and neural computation
Keywords
computational complexity; Boolean functions; NP-complete problems; PRAMs; benchmarks; circuit complexity; complexity classes; computational complexity; counting classes; formal language theory; isomorphisms; neural computation; oracles; p-selective sets; polynomial-time optimization; reducibility; sparse sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
Conference_Location
San Diego, CA, USA
Print_ISBN
0-8186-4070-7
Type
conf
DOI
10.1109/SCT.1993.336547
Filename
336547
Link To Document