Advertisement

Chapter I: Introduction

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 136)

Keywords

Polynomial Time Turing Machine Propositional Formula Graph Isomorphism Counting Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Personalised recommendations