scientific article; zbMATH DE number 3551892

MaRDI QIDQ4125769zbMATH OpenFDO

Authors

Publication date 1977

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(6)

• Toward a unified approach for the classification of NP-complete optimization problems
• Non deterministic polynomial optimization problems and their approximations
• Structure preserving reductions among convex optimization problems
• General approximation algorithms for some arithmetical combinatorial problems
• Discrete extremal problems
• Combinatorial problems over power sets

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 Q4125769)