Abstract
AbstractA structure of finite signature is constructed so that: for all existential formulas and for all tuples of elements of the same length as the tuple one can decide in a quadratic time depending only on the length of the formula, if holds in the structure. In other words, the structure satisfies the relativized model-theoretic version of P=N P in the sense of [4]. This is a model-theoretical approach to results of Hemmerling and Gaßner.
Publisher
Cambridge University Press (CUP)
Reference6 articles.
1. Non-effective Quantifier Elimination
2. [5] Poizat Bruno , Une tentative malheureuse de construire une structure eliminant rapidement les quanteurs, Lecture Notes in Computer Science, vol. 1862, 2000, pp. 61–70.
3. Outline of a Theory of Truth
4. P=NP for some structures over the binary words
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Relativizations of the P =? NP Question for Several Structures;Electronic Notes in Theoretical Computer Science;2008-12
2. Fast Quantifier Elimination Means P = NP;Logical Approaches to Computational Barriers;2006