Fast Quantifier Elimination Means P = NP
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 . The second part is a survey of the structure with fast elimination constructed by the author in .
KeywordsTuring Machine Free Variable Black Point Generic Predicate Input Gate
Unable to display preview. Download preview PDF.
- 2.Blum, L., Shub, M., Smale, S.: On a theory of computation of complexity over the real numbers. American Mathematical Society Bulletin 21 (1989)Google Scholar
- 3.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)Google Scholar
- 6.Poizat, B.: Les petits cailloux. ALEAS, Lyon (1995)Google Scholar