On NC-real complexity classes for additive circuits and their relations with NC
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A note on a P ≠ NP result for a restricted class of real machinesJournal of Complexity, 1992
- PR ≠ NCRJournal of Complexity, 1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989