Fast quantifier elimination means p = NP

Authors:
Mihai Prunescu
Affiliations:
”Dr. Achim Hornecker — Software-Entwicklung und I.T.-Dienstleistungen”, Freiburg im Breisgau, Germany
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 3
Cited 0

Complexity and real computation

Complexity and real computation
Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
P=NP for some structures over the binary words

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Quantified Score

Hi-index	0.00

Visualization

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].