On NC-real complexity classes for additive circuits and their relations with NC (Q5096867): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58338-6_56
+Normal rank
@@ Property / OpenAlex ID @@
+W1516507321
@@ Property / OpenAlex ID: W1516507321 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+\(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
@@ Property / cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / rank @@
+Normal rank
@@ Property / cites work @@
+On digital nondeterminism
@@ Property / cites work: On digital nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+Computing over the reals with addition and order: Higher complexity classes
+Normal rank
@@ Property / cites work @@
+A note on a \(P \neq NP\) result for a restricted class of real machines
+Normal rank
@@ Property / cites work @@
+Q4729767
@@ Property / cites work: Q4729767 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5096867