Find a copy in the library
Finding libraries that hold this item...
|Genre/Form:||Conference papers and proceedings
|Material Type:||Conference publication|
|All Authors / Contributors:||
Paul W Beame; Samuel R Buss; DIMACS (Group); NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
|Notes:||"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Labs, Bell Labs, and Bellcore."
Papers from the proceedings of the DIMACS Workshop on Feasible Arithmetics and Length of Proofs, held on April 21-24, 1996 at Rutgers, New Jersey.
|Description:||xii, 320 pages : illustrations ; 26 cm.|
|Contents:||Plausibly hard combinatorial tautologies / Jeremy Avigad --
More on the relative strength of counting principles / Paul Beame and Søren Riis --
Ranking arithmetic proofs by implicit ramification / Stephen J. Bellantoni --
Lower bounds on Nullstellensatz proofs via designs / Samuel R. Buss --
Relating the provable collapse of P to NC¹ and the power of logical theories / Stephen Cook --
On PHP st-connectivity, and odd charged graphs / Peter Clote and Anton Setzer --
Descriptive complexity and the W hierarchy / Rodney G. Downey, Michael R. Fellows, and Kenneth W. Regan --
Lower bounds on the sizes of cutting plane proofs for modular coloring principles / Xudong Fu --
Equational calculi and constant depth propositional proofs / Jan Johannsen --
Exponential lower bounds for semantic resolution / Stasys Jukna --
Bounded arithmetic : comparison of Buss' witnessing method and Sieg's Herbrand analysis / Barbara Kauffmann --
Towards lower bounds for bounded-depth Frege proofs with modular connectives / Alexis Maciel and Toniann Pitassi --
A quantifier-free theory based on a string algebra for NC¹ / François Pitt --
A propositional proof system for R₂ / Chris Pollett --Algebraic models of computation and interpolation for algebraic proof systems / Pavel Pudlák and Jir̆í Sgall --
Self-reflection principles and NP-hardness / Dan E. Willard.
|Series Title:||DIMACS series in discrete mathematics and theoretical computer science, v. 39.|
|Responsibility:||Paul W. Beame, Samuel R. Buss, editors.|