On the structure of Valiant's complexity classes
From MaRDI portal
Recommendations
Cited in
(16)- Feasible arithmetic computations: Valiant's hypothesis
- Algebraic complexity theory. III: On the complexity of the computation of permanents
- Some aspects of studying an optimization or decision problem in different computational models
- A note on non-complete problems in \(NP_\mathbb{R}\)
- Cook's versus Valiant's hypothesis
- A note on VNP-completeness and border complexity
- Characterizing Valiant's algebraic complexity classes
- Algebraic complexity classes
- On Ladner's result for a class of real machines with restricted use of constants
- scientific article; zbMATH DE number 4108743 (Why is no real title available?)
- scientific article; zbMATH DE number 1375589 (Why is no real title available?)
- On Ladner's result for a class of real machines with restricted use of constants
- Interpolation in Valiant's theory
- scientific article; zbMATH DE number 874695 (Why is no real title available?)
- Noncommutative Valiant's classes: structure and complete problems
- Characterizing Valiant’s Algebraic Complexity Classes
This page was built for publication: On the structure of Valiant's complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381389)
