DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics
Latest Publications

TOTAL DOCUMENTS

16

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By American Mathematical Society

9780821805770, 9781470439972

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A quantifier-free theory based on a string algebra for 𝑁𝐶¹

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/13 ◽

1997 ◽

pp. 229-252

Author(s):

Francois Pitt

Keyword(s):

String Algebra ◽

Free Theory

Bounded arithmetic: Comparison of Buss’ witnessing method and Sieg’s Herbrand analysis

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/11 ◽

1997 ◽

pp. 173-193

Author(s):

Barbara Kauffmann

Keyword(s):

Bounded Arithmetic

Exponential lower bounds for semantic resolution

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/10 ◽

1997 ◽

pp. 163-172 ◽

Cited By ~ 1

Author(s):

Stasys Jukna

Keyword(s):

Lower Bounds ◽

Semantic Resolution

On 𝑃𝐻𝑃, 𝑠𝑡-connectivity, and odd charged graphs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/06 ◽

1997 ◽

pp. 93-117 ◽

Cited By ~ 3

Author(s):

Peter Clote ◽

Anton Setzer

Ranking arithmetic proofs by implicit ramification

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/03 ◽

1997 ◽

pp. 37-57

Author(s):

Stephen Bellantoni

More on the relative strength of counting principles

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/02 ◽

1997 ◽

pp. 13-35 ◽

Cited By ~ 6

Author(s):

Paul Beame ◽

Soren Riis

Keyword(s):

Relative Strength

Plausibly hard combinatorial tautologies

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/01 ◽

1997 ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Jeremy Avigad

Algebraic models of computation and interpolation for algebraic proof systems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/15 ◽

1997 ◽

pp. 279-295 ◽

Cited By ~ 14

Author(s):

Pavel Pudlak ◽

Jiri Sgall

Keyword(s):

Algebraic Proof ◽

Algebraic Models ◽

Models Of Computation ◽

Proof Systems

Descriptive complexity and the 𝑊 hierarchy

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/07 ◽

1997 ◽

pp. 119-134 ◽

Cited By ~ 12

Author(s):

Rodney Downey ◽

Michael Fellows ◽

Kenneth Regan

Keyword(s):

Descriptive Complexity

Equational calculi and constant depth propositional proofs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Proof Complexity and Feasible Arithmetics ◽

10.1090/dimacs/039/09 ◽

1997 ◽

pp. 149-162 ◽

Cited By ~ 1

Author(s):

Jan Johannsen

Keyword(s):

Constant Depth