Pages that link to "Item:Q3140557"
From MaRDI portal
The following pages link to Variable Elimination in Linear Constraints (Q3140557):
Displaying 12 items.
- On Fourier's algorithm for linear arithmetic constraints (Q688575) (← links)
- Fourier elimination for compiling constraint hierarchies (Q698090) (← links)
- Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- Variable Elimination for Disequations in Generalized Linear Constraint Systems (Q3140558) (← links)
- Conflict Resolution (Q3182526) (← links)
- An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}<sup>n</sup> (Q3421386) (← links)
- Reachability and optimal control for linear hybrid automata: a quantifier elimination approach (Q3447004) (← links)
- Practical tools for reasoning about linear constraints (Q3989943) (← links)
- Derivation of feasibility conditions in engineering problems under parametric inequality constraints with classical Fourier elimination (Q4506060) (← links)
- Automated Reasoning (Q5307071) (← links)
- Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions (Q5380309) (← links)