Advertisement

III. Probleme, die zum Erfüllungsproblem der Aussagenlogik polynomial äquivalent sind

  • Peter Schuster
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 43)

Literatur

  1. Karp, R.M., Reducibility among combinatorial problems, IBM Symposium 1972: Complexity of Computer Computations, Plenum Press, New York, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Peter Schuster

There are no affiliations available

Personalised recommendations