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

researchr

You are not signed in
Sign in
Sign up

Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discrete Applied Mathematics, 305:272-294, 2021. [doi]

Abstract is missing.

runs on WebDSL