DocumentCode
3358704
Title
Proceedings of the Sixth Annual Structure in Complexity Theory Conference (Cat. No.91CH3022-1)
fYear
1991
fDate
June 30 1991-July 3 1991
Abstract
The following topics are dealt with: reducibility; counting classes; closure; sparse sets; complexity classes; proofs and provability; time complexity; decision problems; Boolean function complexity; communication complexity; satisfiability; feasibility; queries; branching programs; and circuit complexity
Keywords
Boolean functions; computability; computational complexity; set theory; Boolean function complexity; branching programs; circuit complexity; closure; communication complexity; complexity classes; counting classes; decision problems; feasibility; proofs; provability; queries; reducibility; satisfiability; sparse sets; time complexity;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location
Chicago, IL, USA
Print_ISBN
0-8186-2255-5
Type
conf
DOI
10.1109/SCT.1991.160244
Filename
160244
Link To Document