Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-38536-0_14
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Long Proofs of (Seemingly) Simple Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1984English

Summation, Transformation, and Expansion Formulas for Bibasic Series

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Power-To-Heat in CSP Systems for Capacity Expansion

2019English

Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2016English

Width and Size of Regular Resolution Proofs

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas Beyond Resolution

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2002English

Narrow Proofs May Be Spacious:Separating Space and Width in Resolution

SIAM Journal on Computing
MathematicsComputer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy