skip to content
Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 Preview this item
ClosePreview this item
Checking...

Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996

Author: Paul W Beame; Samuel R Buss; DIMACS (Group); NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
Publisher: Providence, R.I. : American Mathematical Society, ©1998.
Series: DIMACS series in discrete mathematics and theoretical computer science, v. 39.
Edition/Format:   Book : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:

Contains papers that represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Conference proceedings
Congresses
Material Type: Conference publication
Document Type: Book
All Authors / Contributors: Paul W Beame; Samuel R Buss; DIMACS (Group); NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
ISBN: 0821805770 9780821805770
OCLC Number: 37465135
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 p. : ill. ; 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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/37465135>
library:oclcnum"37465135"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/37465135>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/160155122>
rdf:typeschema:Organization
schema:name"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science."
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:copyrightYear"1998"
schema:datePublished"1998"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/354742387>
schema:genre"Conference proceedings"@en
schema:genre"Conference proceedings."@en
schema:inLanguage"en"
schema:name"Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996"@en
schema:numberOfPages"320"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.