scientific article; zbMATH DE number 1498462

MaRDI QIDQ4499533zbMATH OpenFDO

Authors V. M. Khrapchenko

Publication date 30 August 2000

zbMATH Keywords

complexitylower bound

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Philosophy of mathematics (00A30)

Recommendations

• scientific article; zbMATH DE number 1498464
• On algorithm complexity
• scientific article; zbMATH DE number 139642
• scientific article; zbMATH DE number 4087011

Cited in

(1)

• On the meaning of works by V. M. Khrapchenko

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4499533)