Abstract
The first part is a survey of Poizat’s theory about fast elimination of quantifiers and the P = NP question according to the unit-cost model of computation, as developed along the book [7]. The second part is a survey of the structure with fast elimination constructed by the author in [9].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, New York (1998)
Blum, L., Shub, M., Smale, S.: On a theory of computation of complexity over the real numbers. American Mathematical Society Bulletin 21 (1989)
Gaßner, C.: A structure of finite signature with identity relation and with P = NP. Preprints of the University Greifswald number 1, 2, 13, 14 /2004; 1, 9, 17 / 2005; 1 / 2006 (different versions and expositions)
Hemmerling, A.: P = NP for some structures over the binary words. Journal of Complexity 21(4), 557–578 (2005)
Kripke, S.: Outline of a theory of truth. The Journal of Philosophy 72(19), 690–716 (1975)
Poizat, B.: Les petits cailloux. ALEAS, Lyon (1995)
Poizat, B.: Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 61–70. Springer, Heidelberg (2000)
Prunescu, M.: Non-effective quantifier elimination. Mathematical Logic Quarterly 47(4), 557–561 (2001)
Prunescu, M.: Structure with fast elimination of quantifiers. The Journal of Symbolic Logic 71(1), 321–328 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prunescu, M. (2006). Fast Quantifier Elimination Means P = NP. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_47
Download citation
DOI: https://doi.org/10.1007/11780342_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)