Computing functions with parallel queries to NP (Q673784): Difference between revisions

@@ Property / cites work @@
+Q4035689
@@ Property / cites work: Q4035689 / rank @@
+Normal rank
@@ Property / cites work @@
+On the unique satisfiability problem
@@ Property / cites work: On the unique satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Functions computable with nonadaptive queries to NP
+Normal rank
@@ Property / cites work @@
+Enumerative counting is hard
@@ Property / cites work: Enumerative counting is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of some complexity classes between Θ2p and Δ2p
+Normal rank
@@ Property / cites work @@
+Constant Depth Reducibility
@@ Property / cites work: Constant Depth Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of bounded nondeterminism
@@ Property / cites work: Classes of bounded nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+Self-witnessing polynomial-time complexity and prime factorization
+Normal rank
@@ Property / cites work @@
+Q4281541
@@ Property / cites work: Q4281541 / rank @@
+Normal rank
@@ Property / cites work @@
+The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\)
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On counting and approximation
@@ Property / cites work: On counting and approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273947
@@ Property / cites work: Q4273947 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Relativization of questions about log space computability
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the graph isomorphism counting problem
@@ Property / cites work: A note on the graph isomorphism counting problem / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of complexity classes of functions
@@ Property / cites work: A taxonomy of complexity classes of functions / rank @@
+Normal rank
@@ Property / cites work @@
+Positive Relativizations of Complexity Classes
@@ Property / cites work: Positive Relativizations of Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942650
@@ Property / cites work: Q4942650 / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomial-time truth-table reducibility of intractable sets to P-selective sets
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank
@@ Property / cites work @@
+On the Decomposability of $NC$ and $AC$
@@ Property / cites work: On the Decomposability of $NC$ and $AC$ / rank @@
+Normal rank