Calculs sur les structures de langage dénombrable
From MaRDI portal
Publication:5958306
DOI10.1016/S0304-3975(00)00364-9zbMath0984.68076MaRDI QIDQ5958306
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Relativizations of the P=?NP question over the reals (and other ordered rings)
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
- Computational complexity over the \(p\)-adic numbers
- On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?
- Diophantine problems over local fields. III: Decidable fields
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- On definable subsets of p-adic fields
- Computability Over Structures of Infinite Signature
- Accessible telephone directories
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: Calculs sur les structures de langage dénombrable
