Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517): 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.1145/3565286
@@ Property / full work available at URL: https://doi.org/10.1145/3565286 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3013210104
@@ Property / OpenAlex ID: W3013210104 / rank @@
+Normal rank
@@ Property / cites work @@
+Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
+Normal rank
@@ Property / cites work @@
+Unified QBF certification and its applications
@@ Property / cites work: Unified QBF certification and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4790380
@@ Property / cites work: Q4790380 / rank @@
+Normal rank
@@ Property / cites work @@
+Short proofs are narrow—resolution made simple
@@ Property / cites work: Short proofs are narrow—resolution made simple / rank @@
+Normal rank
@@ Property / cites work @@
+On the correspondence between arithmetic theories and propositional proof systems – a survey
+Normal rank
@@ Property / cites work @@
+Q4625702
@@ Property / cites work: Q4625702 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
+Normal rank
@@ Property / cites work @@
+Lower Bounds
@@ Property / cites work: Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q2954985
@@ Property / cites work: Q2954985 / rank @@
+Normal rank
@@ Property / cites work @@
+New Resolution-Based QBF Calculi and Their Proof Complexity
+Normal rank
@@ Property / cites work @@
+Q5270089
@@ Property / cites work: Q5270089 / rank @@
+Normal rank
@@ Property / cites work @@
+Are Short Proofs Narrow? QBF Resolution Is             <i>Not</i>             So Simple
+Normal rank
@@ Property / cites work @@
+A game characterisation of tree-like Q-resolution size
+Normal rank
@@ Property / cites work @@
+Reasons for Hardness in QBF Proof Systems
@@ Property / cites work: Reasons for Hardness in QBF Proof Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Proof systems that take advice
@@ Property / cites work: Proof systems that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+Understanding Gentzen and Frege Systems for QBF
@@ Property / cites work: Understanding Gentzen and Frege Systems for QBF / rank @@
+Normal rank
@@ Property / cites work @@
+A subexponential exact learning algorithm for DNF using equivalence queries
+Normal rank
@@ Property / cites work @@
+Towards NP-P via proof complexity and search
@@ Property / cites work: Towards NP-P via proof complexity and search / rank @@
+Normal rank
@@ Property / cites work @@
+Proof Complexity Modulo the Polynomial Hierarchy
@@ Property / cites work: Proof Complexity Modulo the Polynomial Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Relating size and width in variants of Q-resolution
+Normal rank
@@ Property / cites work @@
+Q5306365
@@ Property / cites work: Q5306365 / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Conformant planning as a case study of incremental QBF solving
+Normal rank
@@ Property / cites work @@
+Contributions to the Theory of Practical Quantified Boolean Formula Solving
+Normal rank
@@ Property / cites work @@
+Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+On Q-Resolution and CDCL QBF Solving
@@ Property / cites work: On Q-Resolution and CDCL QBF Solving / rank @@
+Normal rank
@@ Property / cites work @@
+Expansion-based QBF solving versus Q-resolution
@@ Property / cites work: Expansion-based QBF solving versus Q-resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution for quantified Boolean formulas
@@ Property / cites work: Resolution for quantified Boolean formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of Boolean decision lists
+Normal rank
@@ Property / cites work @@
+\({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
+Normal rank
@@ Property / cites work @@
+Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
+Normal rank
@@ Property / cites work @@
+Q-Resolution with Generalized Axioms
@@ Property / cites work: Q-Resolution with Generalized Axioms / rank @@
+Normal rank
@@ Property / cites work @@
+Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
+Normal rank
@@ Property / cites work @@
+The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank
@@ Property / cites work @@
+The Complexity of Propositional Proofs
@@ Property / cites work: The Complexity of Propositional Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5868872
@@ Property / cites work: Q5868872 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5886517