Proof systems that take advice (Q553297): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+F20
@@ Property / Mathematics Subject Classification ID: 03F20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5932316
@@ Property / zbMATH DE Number: 5932316 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+propositional proof complexity
@@ Property / zbMATH Keywords: propositional proof complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+proof systems
@@ Property / zbMATH Keywords: proof systems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+advice
@@ Property / zbMATH Keywords: advice / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+instance complexity
@@ Property / zbMATH Keywords: instance complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomially bounded proof systems
@@ Property / zbMATH Keywords: polynomially bounded proof systems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimal proof systems
@@ Property / zbMATH Keywords: optimal proof systems / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2010.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2059785423
@@ Property / OpenAlex ID: W2059785423 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59902997
@@ Property / Wikidata QID: Q59902997 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501542
@@ Property / cites work: Q4501542 / rank @@
+Normal rank
@@ Property / cites work @@
+Logarithmic advice classes
@@ Property / cites work: Logarithmic advice classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Instance Complexity and Proof Systems with Advice
+Normal rank
@@ Property / cites work @@
+A tight Karp-Lipton collapse result in bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Does Advice Help to Prove Propositional Tautologies?
+Normal rank
@@ Property / cites work @@
+Tally languages and complexity classes
@@ Property / cites work: Tally languages and complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418680
@@ Property / cites work: Q4418680 / rank @@
+Normal rank
@@ Property / cites work @@
+Resource-Bounded Kolmogorov Complexity Revisited
@@ Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Competing provers yield improved Karp-Lipton collapse results
+Normal rank
@@ Property / cites work @@
+Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Optimal proof systems imply complete sets for promise classes
+Normal rank
@@ Property / cites work @@
+Propositional proof systems, the consistency of first order theories and the complexity of computations
+Normal rank
@@ Property / cites work @@
+Instance complexity
@@ Property / cites work: Instance complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4215637
@@ Property / cites work: Q4215637 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/iandc/BeyersdorffKM11
@@ Property / DBLP publication ID: journals/iandc/BeyersdorffKM11 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:553297