Skip to search formSkip to main contentSkip to account menu

Sharp-SAT

In computational complexity theory, #SAT, or Sharp-SAT, a function problem related to the Boolean satisfiability problem, is the problem of counting… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Boolean satisfiability problemComputational complexity theoryConjunctive normal formCounting problem (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Quantifying error: Extending static timing analysis with probabilistic transitions
Timing analysis is a cornerstone of the digital design process. Statistical Static Timing Analysis was introduced to reduce… 
Review
2014
Review
2014
Theory and Applications of Satisfiability Testing – SAT 2014
Considering the theoretical hardness of SAT, the astonishing adeptness of SAT solvers when attacking practical problems has… 
2010
2010
Solving #SAT Using Extension Rules: Solving #SAT Using Extension Rules
2009
2009
Solving #SAT Using Extension Rules
#SAT problem is the extension of SAT problem. It involves counting models of a given set of proposition formulae. By using the… 
2007
2007
Using More Reasoning to Improve #SAT Solving
Many real-world problems, including inference in Bayes Nets, can be reduced to #SAT, the problem of counting the number of models… 
2004
2004
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
2004
2004
Polynomial Classes of Boolean Formulas for Computing the Degree of Belief
Given a knowledge base Σ and a formula F both in propositional Conjunctive Form, we address the problem of designing efficient… 
2003
2003
Some connections between bounded query classes and non-uniform complexity
1998
1998
Local Search for Statistical Counting
In this paper, statistical counting is introduced in the context of stochastic local search. From a sample of trajectories by… 
1997
1997
Counting sat-chromosome numbers and species characterization in wild species of Chrysanthemum sensu lato by fluorescent in situ hybridization using pTa71 probe
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)