Sciweavers

190 search results - page 3 / 38
» Symmetry and Satisfiability: An Update
Sort
View
JUCS
2007
118views more  JUCS 2007»
13 years 9 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
DAC
2002
ACM
14 years 10 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
TCS
2002
13 years 9 months ago
Tilings as a programming exercise
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
Guy Cousineau
DAC
2004
ACM
14 years 10 months ago
Exploiting structure in symmetry detection for CNF
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah...
CORR
1999
Springer
98views Education» more  CORR 1999»
13 years 9 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt