Pages that link to "Item:Q4194955"

The following pages link to The relative efficiency of propositional proof systems (Q4194955):

Displaying 50 items.

• Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
• Relativization makes contradictions harder for resolution (Q386151) (← links)
• Towards NP-P via proof complexity and search (Q408544) (← links)
• A note on SAT algorithms and proof complexity (Q436581) (← links)
• Parameterized proof complexity (Q451111) (← links)
• On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
• Proof systems that take advice (Q553297) (← links)
• On the complexity of cutting-plane proofs (Q580175) (← links)
• Speedup for natural problems and noncomputability (Q620964) (← links)
• Extended clause learning (Q622116) (← links)
• On theories of bounded arithmetic for \(\mathrm{NC}^1\) (Q638497) (← links)
• Algebraic proofs over noncommutative formulas (Q642520) (← links)
• Proof complexity of propositional default logic (Q647339) (← links)
• Meta-resolution: An algorithmic formalisation (Q671650) (← links)
• Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
• Number of models and satisfiability of sets of clauses (Q672138) (← links)
• Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
• Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
• Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
• The relative complexity of analytic tableaux and SL-resolution (Q687165) (← links)
• Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
• Cut formulas in propositional logic (Q689298) (← links)
• On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
• Inseparability and strong hypotheses for disjoint NP pairs (Q693061) (← links)
• Extension without cut (Q714731) (← links)
• Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
• Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
• Proof complexity of modal resolution (Q832717) (← links)
• Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
• Substitutions into propositional tautologies (Q845921) (← links)
• Canonical disjoint NP-pairs of propositional proof systems (Q868942) (← links)
• Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
• Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
• The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
• Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
• On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
• Resolution over linear equations and multilinear proofs (Q952492) (← links)
• The deduction theorem for strong propositional proof systems (Q987382) (← links)
• A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
• Quantum deduction rules (Q1001909) (← links)
• Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
• Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
• Audiences in argumentation frameworks (Q1028897) (← links)
• Argumentation in artificial intelligence (Q1028943) (← links)
• Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
• A new methodology for developing deduction methods (Q1037405) (← links)
• The intractability of resolution (Q1071750) (← links)
• Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
• Seventy-five problems for testing automatic theorem provers (Q1101242) (← links)
• Propositional consistency proofs (Q1177033) (← links)