Abstract
A fundamental problem in mathematics and computer science is the following: determine whether a given boolean formula is a tautology, that is, whether the formula evaluates to true for all assignments to its variables. It is an open problem already asked by Gödel (in a letter to von Neumann, see [Sip92]), whether there are efficient methods to solve this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2000). Introduction. In: Thierauf, T. (eds) The Computational Complexity of Equivalence and Isomorphism Problems. Lecture Notes in Computer Science, vol 1852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45303-2_1
Download citation
DOI: https://doi.org/10.1007/3-540-45303-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41032-4
Online ISBN: 978-3-540-45303-1
eBook Packages: Springer Book Archive