Sciweavers

741 search results - page 1 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
JSAT
2006
94views more  JSAT 2006»
14 years 9 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
AUSAI
2005
Springer
15 years 3 months ago
Fuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
Radim Belohlávek, Vilém Vychodil
97
Voted
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 10 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
83
Voted
ICS
2010
Tsinghua U.
15 years 1 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
69
Voted
ORL
2007
102views more  ORL 2007»
14 years 9 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov