Details:
| Title | Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm | | Author(s) | Russell Impagliazzo, Pavel Pudlak, Jiri Sgall | | Type | Article in Journal | | Abstract | This paper, all the lower bounds show that in fact any refutation of some initial polynomials has to contain a polynomial f with large degree of f . |
| Language | English | | Journal | Electronic Colloquium on Computational Complexity (ECCC) | | Volume | 4 | | Number | 042 | | Year | 1997 | | Edition | 0 | | Translation |
No | | Refereed |
No |
|
