Review: Paul W. Beame, Samuel R. Buss, Proof Complexity and Feasible Arithmetics, DIMACS Workshop, April 21-24, 1996
Razborov, Alexander A.
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 1823-1825 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1999-12-14
Classification:  
@article{1183745957,
     author = {Razborov, Alexander A.},
     title = {Review: Paul W. Beame, Samuel R. Buss, Proof Complexity and Feasible Arithmetics, DIMACS Workshop, April 21-24, 1996},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 1823-1825},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745957}
}

Razborov, Alexander A. Review: Paul W. Beame, Samuel R. Buss, Proof Complexity and Feasible Arithmetics, DIMACS Workshop, April 21-24, 1996. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  1823-1825. http://gdmltest.u-ga.fr/item/1183745957/