Mechanisms for computing over arbitrary structures
A half-century survey on The Universal Turing Machine
Accessible telephone directories
Journal of Symbolic Logic
Complexity and real computation
Complexity and real computation
Computable analysis: an introduction
Computable analysis: an introduction
The P-DNP problem for infinite Abelian groups
Journal of Complexity
Fast quantifier elimination means p = NP
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Hi-index | 0.00 |
Over the universe of binary words, {0,1}^*, a type of structures of finite signature is defined that satisfy P=NP. This holds true both for the related classes of programs in which tests of equality (identity) of words are allowed, as well as for those in which no equality tests occur. The related structures correspond essentially to the pushdown data structures enriched by predicates which are suitably padded PSPACE-complete word sets.