Optimal advice (Q672755): Difference between revisions

@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Quantitative Relativizations of Complexity Classes
+Normal rank
@@ Property / cites work @@
+Qualitative relativizations of complexity classes
@@ Property / cites work: Qualitative relativizations of complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+On sets Turing reducible to p-selective sets
@@ Property / cites work: On sets Turing reducible to p-selective sets / rank @@
+Normal rank
@@ Property / cites work @@
+PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
@@ Property / cites work: PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS / rank @@
+Normal rank
@@ Property / cites work @@
+P-selectivity: Intersections and indices
@@ Property / cites work: P-selectivity: Intersections and indices / rank @@
+Normal rank
@@ Property / cites work @@
+\(p\)-Selective sets and reducing search to decision vs. self-reducibility
+Normal rank
@@ Property / cites work @@
+Computing Solutions Uniquely Collapses the Polynomial Hierarchy
+Normal rank
@@ Property / cites work @@
+Circuit-size lower bounds and non-reducibility to sparse sets
+Normal rank
@@ Property / cites work @@
+Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
+Normal rank
@@ Property / cites work @@
+Turing machines that take advice
@@ Property / cites work: Turing machines that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+On self-reducibility and weak P-selectivity
@@ Property / cites work: On self-reducibility and weak P-selectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity-Restricted Advice Functions
@@ Property / cites work: Complexity-Restricted Advice Functions / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank