Review: Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi, Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate
Razborov, Alexander
Bull. Symbolic Logic, Tome 8 (2002) no. 1, p. 301-302 / Harvested from Project Euclid
Publié le : 2002-06-15
Classification: 
@article{1182353876,
     author = {Razborov, Alexander},
     title = {Review: Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi, Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate},
     journal = {Bull. Symbolic Logic},
     volume = {8},
     number = {1},
     year = {2002},
     pages = { 301-302},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1182353876}
}
Razborov, Alexander. Review: Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi, Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. Bull. Symbolic Logic, Tome 8 (2002) no. 1, pp.  301-302. http://gdmltest.u-ga.fr/item/1182353876/