Pages that link to "Item:Q2899084"
From MaRDI portal
The following pages link to Incremental satisfiability and implication for UTVPI constraints (Q2899084):
Displaying 12 items.
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Incrementally closing octagons (Q2335904) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- A Graphical Theorem of the Alternative for UTVPI Constraints (Q2787434) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)