VPSPACE and a transfer theorem over the complex field
From MaRDI portal
Recommendations
Cites work
- Characterizing Valiant’s Algebraic Complexity Classes
- Completeness and reduction in algebraic complexity theory
- Finding a vector orthogonal to roughly half a collection of vectors
- scientific article; zbMATH DE number 1500505 (Why is no real title available?)
- scientific article; zbMATH DE number 1834636 (Why is no real title available?)
- scientific article; zbMATH DE number 781350 (Why is no real title available?)
- 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
- Parallel Merge Sort
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- Saturation and stability in the theory of computation over the reals
- Topological complexity of the range searching
- Valiant’s Model: From Exponential Sums to Exponential Products
Cited in
(6)
This page was built for publication: VPSPACE and a transfer theorem over the complex field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034531)