November 01, 1999 article Lower bounds for the polynomial calculus and the Gröbner basis algorithm Computational Complexity DOI: 10.1007/s000370050024 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 120 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access A Finite-Model-Theoretic View on Propositional Proof Complexity 2022 Logical Methods in Computer Science article Computer Science Complexity and Algorithms in Graphs Open access 5 citations 1 result References 0