Pages that link to "Item:Q360099"
From MaRDI portal
The following pages link to Computational complexity of linear constraints over the integers (Q360099):
Displayed 11 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- (Q5005133) (← links)
- Max-Closed Semilinear Constraint Satisfaction (Q5740179) (← links)
- An interdisciplinary experimental evaluation on the disjunctive temporal problem (Q6080502) (← links)