Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,751,254 papers from all fields of science
Search
Sign In
Create Free Account
Circuit satisfiability problem
Known as:
CIRCUIT-SAT
, Circuit satisfiability
, Circuit SAT
Expand
In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Boolean circuit
Boolean satisfiability problem
Conjunctive normal form
Cook–Levin theorem
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Fine-Tuning Decentralized Anonymous Payment Systems based on Arguments for Arithmetic Circuit Satisfiability
Kamil Kluczniak
,
M. Au
IACR Cryptology ePrint Archive
2018
Corpus ID: 4030860
Digital currencies like Bitcoin and other blockchain based systems provide means to record monetary transfers between accounts…
Expand
2017
2017
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark
K. Larsen
,
H. Bodlaender
,
Jean-François Raskin
International Symposium on Mathematical…
2017
Corpus ID: 6531990
The Black-Box Hypothesis, introduced by Barak et al. [5], states that any property of boolean functions decided efficiently (e.g…
Expand
2014
2014
Efficient Generic Zero-Knowledge Proofs from Commitments
Samuel Ranellucci
,
Alain Tapp
,
Rasmus Winther Zakarias
IACR Cryptology ePrint Archive
2014
Corpus ID: 11141575
Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper…
Expand
2010
2010
Stochastic local search for non-clausal and circuit satisfiability
A. Belov
2010
Corpus ID: 124983629
The subject of this dissertation belongs to the area known as classical Propositional Satisfiability. The Propositional…
Expand
2010
2010
Improved Local Search for Circuit Satisfiability
A. Belov
,
Z. Stachniak
International Conference on Theory and…
2010
Corpus ID: 39478975
In this paper we describe a significant improvement to the justificationbased local search algorithm for circuit satisfiability…
Expand
2009
2009
A Novel Circuit SAT Solver in Unbounded Model Checking
Zhaomo Yang
2009
Corpus ID: 59187869
For the circuit-oriented SAT problems,general purpose SAT solver will make some unnecessary decision and implication. The reason…
Expand
2007
2007
3-Valued Circuit SAT for STE with Automatic Refinement
O. Grumberg
,
A. Schuster
,
Avi Yadgar
Automated Technology for Verification and…
2007
Corpus ID: 15448189
Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic…
Expand
2007
2007
QuteSAT: A Robust Circuit-based SAT Solver for Complex Circuit Structure
Chi-An Wu
,
Ting-Hao Lin
,
Chih-Chun Lee
,
Chung-Yang Huang
Design, Automation & Test in Europe Conference…
2007
Corpus ID: 7717975
The paper proposes a robust circuit-based Boolean satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit…
Expand
2005
2005
Boolean Circuits and a DNA Algorithm in Membrane Computing
M. Ionescu
,
Tseren-Onolt Ishdorj
Workshop on Membrane Computing
2005
Corpus ID: 29277679
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes…
Expand
2004
2004
Solutions of some Classical Problems in Various Theoretical DNA Computing Models
István Katsányi
2004
Corpus ID: 18788340
In this work we give e(cid:14)cient molecular computing solutions to eight well-known NP-complete problems, namely the…
Expand
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