Refine
Year of publication
Document Type
Keywords
- 3-Satisfiability (1)
- Algebraic models of computation (1)
- Algebraic proofs (1)
- BSS machines over C (1)
- Complexity theory Saturation (1)
- Decision problems for automata over uncountable structures (1)
- Exponential-time computations (1)
- Generalized finite automata (1)
- Hilbert Nullstellensatz (1)
- Linear and quadratic programming (1)
- NP-completeness (1)
- PCP theorem for NP over the reals (1)
- Probabilistically checkable proofs (1)
- Probabilistically checkable proofs Real and complex number computations PCP theorem Hilbert Nullstellensatz decision problem (1)
- Real and complex number computations (1)
- Real model of computation (1)
- Real number model of computation (1)
- Sparseness (1)
- Structure of complexity classes (1)
- Testing trigonometric polynomials (1)
- complexity (1)