Read-once certification of linear infeasibility in UTVPI constraints

DOI10.1007/978-3-030-14812-6_36MaRDI QIDQ2327508zbMATH OpenOpenAlexFDO

Authors K. Subramani, Piotr Wojciechowski

Publication date 15 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-14812-6_36

Mathematics Subject Classification ID

Recommendations

• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
• Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
• Integer feasibility and refutations in UTVPI constraints using bit-scaling
• Optimal length tree-like refutations of linear feasibility in UTVPI constraints

Cited in

(1)

• Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints

This page was built for publication: Read-once certification of linear infeasibility in UTVPI constraints

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