DocumentCode :
2517360
Title :
Proceedings. Structure in Complexity Theory Fourth Annual Conference (Cat. No.89CH2745-8)
fYear :
1989
fDate :
19-22 June 1989
Abstract :
The following topics are dealt with: isomorphism; completeness; average case complexity; nonuniform complexity; hardness; parallel complexity; recursive sets; finitary substructure languages; parallel random access machines; iterated multiplication; circuit value complexity; decomposition of complexity classes; communication complexity; Kolmogorov complexity; polynomial reductions; Turing machines; relativizations; minimum consistent DFA problem; computable sets; and bounded queries
Keywords :
Turing machines; computational complexity; parallel algorithms; DFA problem; Kolmogorov complexity; Turing machines; average case complexity; bounded queries; circuit value complexity; communication complexity; completeness; computable sets; decomposition of complexity classes; finitary substructure languages; hardness; isomorphism; iterated multiplication; nonuniform complexity; parallel complexity; parallel random access machines; polynomial reductions; recursive sets; relativizations;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
Conference_Location :
Eugene, OR, USA
Print_ISBN :
0-8186-1958-9
Type :
conf
DOI :
10.1109/SCT.1989.41807
Filename :
41807
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2517360
بازگشت