Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,721,885 papers from all fields of science
Search
Sign In
Create Free Account
Sharp-SAT
In computational complexity theory, #SAT, or Sharp-SAT, a function problem related to the Boolean satisfiability problem, is the problem of counting…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Boolean satisfiability problem
Computational complexity theory
Conjunctive normal form
Counting problem (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Quantifying error: Extending static timing analysis with probabilistic transitions
Kevin E. Murray
,
A. Suardi
,
Vaughn Betz
,
G. Constantinides
Design, Automation and Test in Europe
2017
Corpus ID: 1690732
Timing analysis is a cornerstone of the digital design process. Statistical Static Timing Analysis was introduced to reduce…
Expand
Review
2014
Review
2014
Theory and Applications of Satisfiability Testing – SAT 2014
C. Sinz
,
Uwe Egly
Lecture Notes in Computer Science
2014
Corpus ID: 33927619
Considering the theoretical hardness of SAT, the astonishing adeptness of SAT solvers when attacking practical problems has…
Expand
2010
2010
Solving #SAT Using Extension Rules: Solving #SAT Using Extension Rules
Minghao Yin
,
Hai Lin
,
Jigui Sun
2010
Corpus ID: 62681377
2009
2009
Solving #SAT Using Extension Rules
Yin Ming
2009
Corpus ID: 63201664
#SAT problem is the extension of SAT problem. It involves counting models of a given set of proposition formulae. By using the…
Expand
2004
2004
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
A. Pavan
,
A. Selman
,
Samik Sengupta
,
N. V. Vinodchandran
Proceedings. 19th IEEE Annual Conference on…
2004
Corpus ID: 6105728
2004
2004
Polynomial Classes of Boolean Formulas for Computing the Degree of Belief
Guillermo De Ita Luna
Ibero-American Conference on AI
2004
Corpus ID: 46727326
Given a knowledge base Σ and a formula F both in propositional Conjunctive Form, we address the problem of designing efficient…
Expand
2003
2003
Some connections between bounded query classes and non-uniform complexity
A. Amir
,
R. Beigel
,
W. Gasarch
Information and Computation
2003
Corpus ID: 2457565
1998
1998
Local Search for Statistical Counting
O. Bailleux
AAAI/IAAI
1998
Corpus ID: 11190313
In this paper, statistical counting is introduced in the context of stochastic local search. From a sample of trajectories by…
Expand
1997
1997
Counting sat-chromosome numbers and species characterization in wild species of Chrysanthemum sensu lato by fluorescent in situ hybridization using pTa71 probe
Yoshito Honda
,
Abdulrazak Hussein
,
H. Ogura
,
K. Kondo
,
R. Tanaka
,
T. Shidahara
1997
Corpus ID: 82263951
1991
1991
A Note on Enumarative Counting
Jin-Yi Cai
,
Lane A. Hemaspaandra
Information Processing Letters
1991
Corpus ID: 41535982
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)
ACCEPT & CONTINUE