Cook's versus Valiant's hypothesis
From MaRDI portal
Publication:1978701
Recommendations
Cites work
- scientific article; zbMATH DE number 1375589 (Why is no real title available?)
- scientific article; zbMATH DE number 3744549 (Why is no real title available?)
- scientific article; zbMATH DE number 3778752 (Why is no real title available?)
- scientific article; zbMATH DE number 3785018 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 599115 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- scientific article; zbMATH DE number 953010 (Why is no real title available?)
- scientific article; zbMATH DE number 3450338 (Why is no real title available?)
- scientific article; zbMATH DE number 806915 (Why is no real title available?)
- Arithmetization: A new method in structural complexity theory
- Completeness and reduction in algebraic complexity theory
- Fast Parallel Computation of Polynomials Using Few Processors
- Feasible arithmetic computations: Valiant's hypothesis
- Finding the number of factors of a polynomial
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- NP is as easy as detecting unique solutions
- Number fields
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Power of Real Turing Machines over Binary Inputs
- The Complexity of Enumeration and Reliability Problems
- The complexity of computing the permanent
- The complexity of theorem-proving procedures
Cited in
(15)- On the algebraic complexity of some families of coloured Tutte polynomials
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Most secant varieties of tangential varieties to Veronese varieties are nondefective
- An approximation approach to Cook hypothesis
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
- Characterizing Valiant’s Algebraic Complexity Classes
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- Algebraic complexity classes
- Interpolation in Valiant's theory
- Kolmogorov Complexity Theory over the Reals
- Dual VP classes
- Lower bounds for the determinantal complexity of explicit low degree polynomials
- Characterizing Valiant's algebraic complexity classes
- No occurrence obstructions in geometric complexity theory
This page was built for publication: Cook's versus Valiant's hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978701)
