Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Paul Beam, Samuel R. Buss, editors, Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996. Volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, DIMACS/AMS, 1998. [doi]

Conference: dimacs1998

Abstract is missing.

Plausibly hard combinatorial tautologiesJeremy Avigad. 1-12

Ranking arithmetic proofs by implicit ramificationStephen J. Bellantoni. 37-58

Lower bounds on Nullstellensatz proofs via designsSamuel R. Buss. 59-72

1 and the power of logical theoriesStephen Cook. 73-92

PHP st-connectivity, and odd charged graphsPeter Clote, Anton Setzer. 93-118

W hierarchyRodney G. Downey, Michael R. Fellows, Kenneth W. Regan. 119-134

Lower bounds on sizes of cutting plane proofs for modular coloring principlesXudong Fu. 135-148

Equational calculi and constant depth propositional proofsJan Johannsen. 149-162

Exponential lower bounds for semantic resolutionStasys Jukna. 163-172

Bounded arithmetic: Comparison of Buss' witnessing method and Sieg's Herbrand analysisBarbara Kauffmann. 173-194

Towards lower bounds for bounded-depth Frege proofs with modular connectivesAlexis Maciel, Toniann Pitassi. 195-228

1François Pitt. 229-252

2Chris Pollett. 253-278

Algebraic models of computation and interpolation for algebraic proof systemsPavel Pudlák, Jirí Sgall. 279-296

Self-reflection principles and NP-hardnessDan E. Willard. 297

runs on WebDSL