On measures of space over real and complex numbers
From MaRDI portal
Publication:2019497
DOI10.1007/978-3-030-58150-3_41OpenAlexW3082918032MaRDI QIDQ2019497FDOQ2019497
Om Prakash, B. V. Raghavendra Rao
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_41
Cites Work
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The complexity of computing the permanent
- A probabilistic remark on algebraic program testing
- Title not available (Why is that?)
- Computing Algebraic Formulas Using a Constant Number of Registers
- Problems complete for deterministic logarithmic space
- Arithmetic Circuits: A survey of recent results and open questions
- Title not available (Why is that?)
- The Parallel Evaluation of General Arithmetic Expressions
- On the Complexity of Quantifier Elimination: the Structural Approach
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- A weak version of the Blum, Shub, and Smale model
- Title not available (Why is that?)
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\)
- Title not available (Why is that?)
- On weak-space complexity over complex numbers
- Logical Approaches to Computational Barriers
This page was built for publication: On measures of space over real and complex numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019497)
