Advertisement

II. Polynomial beschränkte nichtdeterministische Turingmaschinen und die Vollständigkeit des aussagelogischen Erfüllungsproblems

  • Alex Häussler
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 43)

Literatur

  1. Cook, S.A., The complexity of Theorem-Proving Procedures, Conf. Rec. of Third ACM Symp. on Th. of Computing (1970) 151–158.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Alex Häussler

There are no affiliations available

Personalised recommendations