On NC-real complexity classes for additive circuits and their relations with NC

DOI10.1007/3-540-58338-6_56zbMath1494.68088OpenAlexW1516507321MaRDI QIDQ5096867

Michel Cosnard, Martin Matamala

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_56

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other nonclassical models of computation (68Q09) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• A note on a \(P \neq NP\) result for a restricted class of real machines
• Computing over the reals with addition and order: Higher complexity classes
• On digital nondeterminism
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: On NC-real complexity classes for additive circuits and their relations with NC