Showing 1 - 20 of 109

1

Proof Complexity and the Binary Encoding of Combinatorial Principles
Dantchev S. ; Galesi N. ; Ghani A. ; et al.
SIAM Journal on Computing. 53:764-802

FOS: Computer and inform... Computer Science - Logic... Computer Science - Compu... binary encoding lift-and-project methods propositional proof comp...
Academic journal
Save to List
2

On optimal heuristic randomized semidecision procedures, with application to proof complexity
Hirsch, Edward A. ; Itsykson, Dmitry ; St. Petersburg Department of V.A. Steklov Mathematical Institute (PDMI RAS) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :453-464

Nancy, France propositional proof comp... optimal algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-CC]Computer S...
Conference
Save to List
3

Some Subsystems of Constant-Depth Frege with Parity
Garlik, Michal ; Kolodziejczyk, Andrzej ; Universitat Politècnica de Catalunya. Departament de Ciències de la Computació ; et al.
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
ACM Transactions on Computational Logic

Computational complexity Constant-depth Frege Propositional proof comp... Polinomis 0102 computer and inform... 0101 mathematics
Academic journal
Save to List
4

A switching lemma for small restrictions and lower bounds for k-DNF resolution
Segerlind, Nate ; Buss, Sam ; Impagliazzo, Russell
SIAM Journal on Computing. 33(5)

propositional proof comp... Boolean circuit complexi... switching lemmas lower bounds k-DNFs resolution
Academic journal
Save to List
5

The Ordering Principle in a Fragment of Approximate Counting
Atserias, Albert ; Thapen, Neil ; Universitat Politècnica de Catalunya. Departament de Ciències de la Computació ; et al.
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I

computational complexity bounded arithmetic 0102 computer and inform... Polynomial local search 16. Peace & justice 01 natural sciences
Academic journal
Save to List
6

An Exponential Lower Bound for Proofs in Focused Calculi
Jalali Keshavarz, R. (Raheleh)
Lecture Notes in Computer Science ISBN: 9783662595329

super-intuitionistic log... focused calculi propositional proof comp... feasible interpolation 0102 computer and inform... 0101 mathematics
Book
Save to List
7

Complexity of Propositional Proofs Under a Promise
Dershowitz, N. ; Tzameret, I. (Iddo)
Lecture Notes in Computer Science ISBN: 9783540734192

FOS: Computer and inform... Computer Science - Logic... resolution 0102 computer and inform... Computational Complexity... 01 natural sciences
Book
Save to List
8

Short propositional refutations for dense random 3CNF formulas
Müller, Sebastian ; Tzameret, Iddo
In Annals of Pure and Applied Logic December 2014 165(12):1864-1918

Academic journal
Save to List
9

On the Automatizability of Resolution and Related Propositional Proof Systems: On the automatizability of resolution and related propositional proof systems
Albert Atserias ; Maria Luisa Bonet
Lecture Notes in Computer Science ISBN: 9783540442400

Res(2) Complexity of proofs propositional proof syst... satisfiability problem resolution Automatizability
Book
Save to List
10

Some applications of propositional logic to cellular automata
Cavagnetto, S. (Stefano)
Mathematical Logic Quarterly. 55:605-616

propositional proof comp... 0102 computer and inform... 0101 mathematics propositional logic cellular 01 natural sciences
Academic journal
Save to List
11

On the Chvátal rank of the Pigeonhole Principle
Mark Rhodes
Theoretical Computer Science. 410:2774-2778

Cutting planes Chvátal rank 0211 other engineering a... Propositional proof comp... Pigeonhole principle 0102 computer and inform...
Academic journal
Save to List
12

Substitution Frege and extended Frege proof systems in non-classical logics
Jeřábek, E. (Emil)
Annals of Pure and Applied Logic. 159:1-48

propositional proof comp... Logic 0102 computer and inform... Frege system 0101 mathematics model logic
Academic journal
Save to List
13

Tight rank lower bounds for the Sherali–Adams proof system
Dantchev, Stefan ; Martin, Barnaby ; Rhodes, Mark
Theoretical Computer Science. 410:2054-2063

0211 other engineering a... Propositional proof comp... 0102 computer and inform... 02 engineering and techn... Lift-and-project methods 01 natural sciences
Academic journal
Save to List
14

The limits of tractability in Resolution-based propositional proof systems
Dantchev, Stefan ; Martin, Barnaby
In Annals of Pure and Applied Logic June 2012 163(6):656-668

Academic journal
Save to List
15

SIZE-SPACE TRADEOFFS FOR RESOLUTION
BEN-SASSON, Eli
SIAM journal on computing (Print). 38(6):2511-2525

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Academic journal
Save to List
16

On the Chvátal rank of the Pigeonhole Principle
RHODES, Mark
Theoretical computer science. 410(27-29):2774-2778

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Academic journal
Save to List
17

Frege systems for extensible modal logics
Jeřábek, E. (Emil)
Annals of Pure and Applied Logic. 142:366-379

propositional proof comp... admissible rules Logic 0102 computer and inform... 0101 mathematics 01 natural sciences
Academic journal
Save to List
18

Several notes on the power of Gomory–Chvátal cuts
Arist Kojevnikov ; Edward A. Hirsch
Annals of Pure and Applied Logic. 141:429-436

Logic Propositional proof comp... Integer programming 0102 computer and inform... 0101 mathematics 01 natural sciences
Academic journal
Save to List
19

LOWER BOUNDS FOR LOVÁSZ-SCHRIJVER SYSTEMS AND BEYOND FOLLOW FROM MULTIPARTY COMMUNICATION COMPLEXITY
BEAME, Paul ; PITASSI, Toniann ; SEGERLIND, Nathan
SIAM journal on computing (Print). 37(3):845-869

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Academic journal
Save to List
20

Mutilated chessboard problem is exponentially hard for resolution
Michael Alekhnovich
Theoretical Computer Science. 310:513-525

Complexity of proofs Analysis of algorithms a... Lower bounds 0102 computer and inform... 02 engineering and techn... 01 natural sciences
Academic journal
Save to List

Filter