scientific article; zbMATH DE number 1850736
From MaRDI portal
Publication:4787878
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
Publication date: 3 April 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items