Results 1  10
of
453
Proving SAT does not have Small Circuits with an Application to the Two Queries Problem
, 2002
"... We show that if SAT does not have small circuits, then there must exist a small number of formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if P , then the polynomialtime hierarchy collapses to S ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We show that if SAT does not have small circuits, then there must exist a small number of formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if P , then the polynomialtime hierarchy collapses
Proving SAT does not have Small Circuits with an Application to the Two Queries Problem
"... We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if P NP[1] = P NP[2] , then the polynomialtime h ..."
Abstract
 Add to MetaCart
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if P NP[1] = P NP[2] , then the polynomial
Proving SAT does not have Small Circuits with an Application to the Two Queries Problem
"... We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if P NP[1] = P NP[2] , then the polynomialtime h ..."
Abstract
 Add to MetaCart
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if P NP[1] = P NP[2] , then the polynomial
Proving SAT does not have Small Circuits with an Application to the Two Queries Problem
"... We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if PNP[1] = PNP[2] , then the polynomialtime hie ..."
Abstract
 Add to MetaCart
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability correctly on at least one of these formulas. We use this result to show that if PNP[1] = PNP[2] , then the polynomial
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
 Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs
 Ninth International Symposium on AI and Mathematics
"... In the past few years, we have seen significant progress in the area of Boolean satisfiability (SAT) solving and its applications. More recently, new e#orts have focused on developing solvers for Quantified Boolean Formulas (QBFs). Recent QBF evaluation results show that developing practical QBF ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In the past few years, we have seen significant progress in the area of Boolean satisfiability (SAT) solving and its applications. More recently, new e#orts have focused on developing solvers for Quantified Boolean Formulas (QBFs). Recent QBF evaluation results show that developing practical QBF
Learning via Queries
, 2006
"... Query learning is one of the most important active learning models that have been studied in the literature. In this thesis, we study two types of queries, namely, edgedetecting queries and valueinjecting queries, both of which are motivated by biological applications. Motivated by PCR experiments ..."
Abstract
 Add to MetaCart
Query learning is one of the most important active learning models that have been studied in the literature. In this thesis, we study two types of queries, namely, edgedetecting queries and valueinjecting queries, both of which are motivated by biological applications. Motivated by PCR
DistributionAware Sampling and Weighted Model Counting for SAT ∗ †
"... Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distributionaware sampling of satisfying assignments. Both problems have a wide variety of important applications. Due to the inherent complexity of the exact versions ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distributionaware sampling of satisfying assignments. Both problems have a wide variety of important applications. Due to the inherent complexity of the exact
Scaling Today’s SAT Solver
, 2011
"... The last two decades saw an astounding increase in both the scientific capability and realworld applicability of standard SAT solvers. Breakthroughs like conflictdirected backjumping and clause learning led to wellknown, open source solvers like zChaff [3] and MiniSAT [1]. This newfound power, co ..."
Abstract
 Add to MetaCart
The last two decades saw an astounding increase in both the scientific capability and realworld applicability of standard SAT solvers. Breakthroughs like conflictdirected backjumping and clause learning led to wellknown, open source solvers like zChaff [3] and MiniSAT [1]. This newfound power
Results 1  10
of
453