SELF-SPECIFYING MACHINES (Q5249003): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+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 @@
+A uniform approach to define complexity classes
@@ Property / cites work: A uniform approach to define complexity classes / 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 @@
+On the power of parity polynomial time
@@ Property / cites work: On the power of parity polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Gap-definable counting classes
@@ Property / cites work: Gap-definable counting classes / rank @@
+Normal rank
@@ Property / cites work @@
+On the construction of parallel computers from various basis of Boolean functions
+Normal rank
@@ Property / cites work @@
+The power of the middle bit of a \(\#\)P function
@@ Property / cites work: The power of the middle bit of a \(\#\)P function / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold Computation and Cryptographic Security
@@ Property / cites work: Threshold Computation and Cryptographic Security / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets with Efficient Implicit Membership Tests
@@ Property / cites work: On Sets with Efficient Implicit Membership Tests / rank @@
+Normal rank
@@ Property / cites work @@
+Query Order
@@ Property / cites work: Query Order / rank @@
+Normal rank
@@ Property / cites work @@
+Defying upward and downward separation
@@ Property / cites work: Defying upward and downward separation / rank @@
+Normal rank
@@ Property / cites work @@
+Universally serializable computation
@@ Property / cites work: Universally serializable computation / rank @@
+Normal rank
@@ Property / cites work @@
+On balanced versus unbalanced computation trees
@@ Property / cites work: On balanced versus unbalanced computation trees / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace and logtime leaf languages
@@ Property / cites work: Logspace and logtime leaf languages / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity-Restricted Advice Functions
@@ Property / cites work: Complexity-Restricted Advice Functions / 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 @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity theory for feasible closure properties
+Normal rank
@@ Property / cites work @@
+Reductions on NP and p-selective sets
@@ Property / cites work: Reductions on NP and p-selective sets / rank @@
+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 @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
+Normal rank
@@ Property / cites work @@
+THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
@@ Property / cites work: THE COMPLEXITY OF FINDING MIDDLE ELEMENTS / rank @@
+Normal rank
@@ Property / cites work @@
+Some observations on the connection between counting and recursion
+Normal rank
@@ Property / cites work @@
+A note on parallel queries and the symmetric-difference hierarchy.
+Normal rank
@@ Property / cites work @@
+Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
+Normal rank
@@ Property / cites work @@
+#P-COMPLETENESS VIA MANY-ONE REDUCTIONS
@@ Property / cites work: #P-COMPLETENESS VIA MANY-ONE REDUCTIONS / rank @@
+Normal rank