96 search results - page 3 / 20 » The Satisfiability Threshold for k-XORSAT |
IGPL
2006
13 years 5 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
SIAMNUM
2010
13 years 13 hour ago
2010
We study equations to describe incompressible generalized Newtonian fluids, where the extra stress tensor satisfies a nonstandard anisotropic asymptotic growth condition. An implic...
IJCAI
2001
13 years 6 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
JAIR
2000
13 years 5 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...