P versus NP and computability theoretic constructions in complexity theory over algebraic structures
From MaRDI portal
Publication:5313380
Recommendations
- On relativizations of the P =? NP question for several structures
- On P Versus NP for Parameter-Free Programs Over Algebraic Structures
- \(\mathbf P =\mathbf{NP}\) for some structures over the binary words
- Fields of algebraic numbers computable in polynomial time. II
- Oracles and relativizations of the P =? NP question for several structures
Cites work
- A model-theoretic proof for P ≠ NP over all infinite abelian group
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- Computability Over Structures of Infinite Signature
- Computing over the reals with addition and order
- scientific article; zbMATH DE number 3286895 (Why is no real title available?)
- On P Versus NP for Parameter-Free Programs Over Algebraic Structures
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Cited in
(9)- \(\mathbf P =\mathbf{NP}\) for some structures over the binary words
- On P Versus NP for Parameter-Free Programs Over Algebraic Structures
- From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)
- scientific article; zbMATH DE number 1834636 (Why is no real title available?)
- Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
- On relativizations of the P =? NP question for several structures
- Expansions of pseudoinfinite structures and circuit and proof complexity
- Structure with fast elimination of quantifiers
- Calculs sur les structures de langage dénombrable
This page was built for publication: P versus NP and computability theoretic constructions in complexity theory over algebraic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313380)
