On the parallel complexity of the polynomial ideal membership problem
From MaRDI portal
Publication:1271168
DOI10.1006/jcom.1998.0472zbMath0936.68054OpenAlexW2058554690MaRDI QIDQ1271168
Publication date: 11 November 1998
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1998.0472
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- Definability and fast quantifier elimination in algebraically closed fields
- A new lower bound construction for commutative Thue systems with applications
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- The complexity of linear problems in fields
- Real quantifier elimination is doubly exponential
- On the complexity of computing syzygies
- Test complexity of generic polynomials
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- Some complexity results for polynomial ideals
- Lower bounds for arithmetic networks
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Semi-algebraic complexity of quotients and sign determination of remainders
- On the Complexity of Quantifier Elimination: the Structural Approach
- The Computational Complexity of Continued Fractions
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
- On Relating Time and Space to Size and Depth
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Membership in polynomial ideals over Q is exponential space complete
- Parallelism in random access machines
This page was built for publication: On the parallel complexity of the polynomial ideal membership problem
