scientific article; zbMATH DE number 1850736

DOI<602::AID-MALQ602>3.0.CO;2-J 10.1002/1521-3870(200211)48:4<602::AID-MALQ602>3.0.CO;2-JzbMath1013.03069MaRDI QIDQ4787878

Jan Krajíček

Publication date: 3 April 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation methodproof systemsproof complexityfeasible interpolation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items

On the automatizability of polynomial calculus ⋮ Unnamed Item