Accessible telephone directories

DOI10.2307/2275252zbMath0804.03028OpenAlexW2111235650MaRDI QIDQ4292595

Bruno Poizat

Publication date: 22 January 1995

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275252

zbMATH Keywords

quantifier-eliminationcomputation over arbitrary structures

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (15)

Algorithms yield upper bounds in differential algebra ⋮ P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) ⋮ \(\mathbf P =\mathbf{NP}\) for some structures over the binary words ⋮ Two situations with unit-cost: ordered abelian semi-groups and some commutative rings ⋮ Elimination of constants from machines over algebraically closed fields ⋮ Universal resolution for NP-complete problems ⋮ A note on non-complete problems in \(NP_\mathbb{R}\) ⋮ A weak version of the Blum, Shub, and Smale model ⋮ Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH ⋮ Calculs sur les structures de langage dénombrable ⋮ Real computational universality: the word problem for a class of groups with infinite presentation ⋮ On digital nondeterminism ⋮ Some aspects of studying an optimization or decision problem in different computational models ⋮ Saturation and stability in the theory of computation over the reals ⋮ Computational complexity of multi-player evolutionarily stable strategies

Cites Work

• Des belles paires aux beaux uples

This page was built for publication: Accessible telephone directories