A problem that is easier to solve on the unit-cost algebraic RAM
From MaRDI portal
Publication:1203641
DOI10.1016/0885-064X(92)90003-TzbMath0759.68039MaRDI QIDQ1203641
Publication date: 22 February 1993
Published in: Journal of Complexity (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Semidefinite programming in combinatorial optimization ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ Financial networks with singleton liability priorities ⋮ Financial networks with singleton liability priorities ⋮ Equilibria, fixed points, and complexity classes ⋮ Bounding the sum of square roots via lattice reduction ⋮ Complexity of Restricted Variants of Skolem and Related Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decreasing the nesting depth of expressions involving square roots
- Simplification of expressions involving radicals
- Geometric algorithms and combinatorial optimization
- On the computational power of pushdown automata
- A lower bound for integer greatest common divisor computations
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: A problem that is easier to solve on the unit-cost algebraic RAM
