A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
From MaRDI portal
Publication:1702822
DOI10.1007/S10878-017-0176-3zbMATH Open1394.90499OpenAlexW2759459399MaRDI QIDQ1702822FDOQ1702822
Authors: K. Subramani, Piotr Wojciechowski 
Publication date: 1 March 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0176-3
Recommendations
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- Integer feasibility and refutations in UTVPI constraints using bit-scaling
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Frontiers of Combining Systems
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
Cites Work
- Title not available (Why is that?)
- The octagon abstract domain
- Introduction to algorithms
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Computer Aided Verification
- Fourier-Motzkin elimination and its dual
- Shortest paths algorithms: Theory and experimental evaluation
- The intractability of resolution
- Frontiers of Combining Systems
- Parametric dispatching of hard real-time tasks
- Incremental satisfiability and implication for UTVPI constraints
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
- Logic for Programming, Artificial Intelligence, and Reasoning
Cited In (11)
- A Graphical Theorem of the Alternative for UTVPI Constraints
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- On integer closure in a system of unit two variable per inequality constraints
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
- Integer feasibility and refutations in UTVPI constraints using bit-scaling
- On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
Uses Software
This page was built for publication: A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702822)
