Classes of representable disjoint \textsf{NP}-pairs (Q884465): 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.1016/j.tcs.2007.02.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2134646730
@@ Property / OpenAlex ID: W2134646730 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57950018
@@ Property / Wikidata QID: Q57950018 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411848
@@ Property / cites work: Q4411848 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-automatizability of bounded-depth Frege proofs
+Normal rank
@@ Property / cites work @@
+Lower bounds for cutting planes proofs with small coefficients
+Normal rank
@@ Property / cites work @@
+On Interpolation and Automatization for Frege Systems
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Reductions between disjoint NP-pairs
@@ Property / cites work: Reductions between disjoint NP-pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint NP-Pairs
@@ Property / cites work: Disjoint NP-Pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Measures for Public-Key Cryptosystems
@@ Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank @@
+Normal rank
@@ Property / cites work @@
+Oracles for structural properties: The isomorphism problem and public-key cryptography
+Normal rank
@@ Property / cites work @@
+Optimal proof systems imply complete sets for promise classes
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+Quantified propositional calculi and fragments of bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Some consequences of cryptographical conjectures for \(S_2^1\) and EF
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for resolution and cutting plane proofs and monotone computations
+Normal rank
@@ Property / cites work @@
+Q4934563
@@ Property / cites work: Q4934563 / rank @@
+Normal rank
@@ Property / cites work @@
+On reducibility and symmetry of disjoint NP pairs.
+Normal rank