scientific article; zbMATH DE number 614557

MaRDI QIDQ4300879zbMATH OpenFDO

Authors V. A. Unguryanu

Publication date 2 February 1995

zbMATH Keywords

\(NP\)-difficultyimbeddabilityorthogonal projectionpolyhedral setsystem of linear inequalitiesunit cube

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 614554
• Embeddability in \(\mathbb R^3\) is NP-hard
• On the complexity of the embedding problem for hypercube related graphs
• scientific article; zbMATH DE number 1138221

Cited in

(2)

• scientific article; zbMATH DE number 614554 (Why is no real title available?)
• scientific article; zbMATH DE number 1138221 (Why is no real title available?)

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