Verwandte Artikel zu Proof Complexity and Feasible Arithmetics: Dimacs Workshop...

Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 39, Band 39) - Hardcover

Dimacs (Group); NSF Science And Technology Center In Discrete Mathematics And Theoretical Computer Science; DIMACS Workshop On Feasible Arithmetics And Length Of Proofs (1996 : Rutgers University)

 
9780821805770: Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 39, Band 39)
Hardcover
ISBN 10: 0821805770 ISBN 13: 9780821805770
Verlag: American Mathematical Society, 1997

Inhaltsangabe

The 16 papers reflect some of the breakthroughs over the past dozen years in understanding whether or not logical inferences can be made in certain situations and what resources are necessary to make such inferences, questions that play a large role in computer science and artificial intelligence. They discuss such aspects as lower bounds in proof complexity, witnessing theorems and proof systems for feasible arithmetic, algebraic and combinatorial proof systems, and the relationship between proof complexity and Boolean circuit complexity. No index. Member prices are $47 for institutions and $35 for individuals. Annotation c. by Book News, Inc., Portland, Or.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
American Mathematical Society
Erscheinungsdatum
1997
Sprache
Englisch
ISBN 10 
0821805770
ISBN 13 
9780821805770
Einband
Gebundene Ausgabe
Anzahl der Seiten
320
Herausgeber
Beame Paul W., Buss Samuel R.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar