Pages that link to "Item:Q2638780"
From MaRDI portal
The following pages link to On the parallel complexity of discrete relaxation in constraint satisfaction networks (Q2638780):
Displaying 17 items.
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- A generic arc-consistency algorithm and its specializations (Q1199922) (← links)
- Neural network methods in combinatorial optimization (Q1200816) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- Fast parallel constraint satisfaction (Q1313952) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- A parallel algorithm for GAC filtering of the Alldifferent constraint (Q2170220) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- Asynchronous aggregation and consistency in distributed constraint satisfaction (Q2457696) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- The complexity of constraint satisfaction revisited (Q2675271) (← links)
- aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming (Q3449196) (← links)
