On the boolean closure of NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 199 LNCS, Issue , 1985, Pages 485-493

  Wechsung, Gerd ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MACHINERY; POLYNOMIAL APPROXIMATION;

ALTERNATING TURING MACHINES; COMPUTATIONAL POWER; P-COMPLETE; POLYNOMIAL-TIME;

TURING MACHINES;

EID: 85034444833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028832     Document Type: Conference Paper

References (6)

1. Cook, S.A., The complexity of theorem proving procedures, Proc. of the 3rd ACM Symposium on Theory of Computing (1971), 151-158.
2. Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979.
3. Hausdorff, F., Grundziige der Mengenlehre, Leipzig 1914.
4. Papadimitriou, C.H.H., Yannakakis, M., The complexity of facets (and some facets of complexity), Proc. of the 14th ACM Symposium on Theory of Computing (1982), 255-260.
5. Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company New York, St. Louis, San Francisco, Toronto, London Sidney.
6. Wagner, Klaus, On to -regular sets, Information and Control 43 (1979), 123-177.