Pages that link to "Item:Q931750"
From MaRDI portal
The following pages link to Formula dissection: A parallel algorithm for constraint satisfaction (Q931750):
Displaying 7 items.
- A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula (Q1199880) (← links)
- A tagging method for parallel constraint satisfaction (Q1200169) (← links)
- Local consistency in parallel constraint satisfaction networks (Q1337684) (← links)
- A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes (Q1357089) (← links)
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- On the constraint length of random \(k\)-CSP (Q2352362) (← links)
- Partitioning methods for satisfiability testing on large formulas (Q4647562) (← links)