Deciding membership in a class of polyhedra

MaRDI QIDQ3455602zbMATH OpenFDO

Authors Salvatore Ruggieri

Publication date 11 December 2015

Full work available at URL http://ebooks.iospress.nl/volumearticle/7056

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Representation for multiple right-hand sides
• scientific article; zbMATH DE number 3952498
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
• On recognizing integer polyhedra
• On a decision procedure for quantified linear programs

Cited in

(1)

• Declarative reasoning on explanations using constraint logic programming

This page was built for publication: Deciding membership in a class of polyhedra

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