Jump to main content

yr 〜
yr

Search results 3

Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 -- : Feasible arithmetics and length of proofs : Workshop : Apr 1996, Rutgers, NJ. (DIMACS Series in Discrete Mathematics and Theoretical Computer Science ; 39)

Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 -- : Feasible arithmetics and length of proofs : Workshop : Apr 1996, Rutgers, NJ. (DIMACS Series in Discrete Mathematics and Theoretical Computer Science ; 39)
Paper図書
American Mathematical Society1998.<M17-01-1636>
National Diet Library

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

Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996
Paper図書
Paul W. Beame, Samuel R. Buss, editorsAmerican Mathematical Societyc1998
Other Libraries in Japan

DIMACS series in discrete mathematics and theoretical computer science

DIMACS series in discrete mathematics and theoretical computer science
Paper図書
American Mathematical Society
Other Libraries in Japan
  • Related Material...er 17-19, 1994 Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 Network design : connectivity...

Reached to the end of result.

RSS