Skip to main content
Conference Proceedings

Fast quantifier elimination means P = NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3988 LNCS 459-470
DOI: 10.1007/11780342_47
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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]. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Prunescu, M. (2006). Fast quantifier elimination means P = NP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3988 LNCS, pp. 459–470). Springer Verlag. https://doi.org/10.1007/11780342_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free