Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,983,676 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
CMPT 407-Complexity Theory Lecture 5 : SAT , coNP , Search-to-Decision , NTime Hierarchy
Valentine Kabanets
2017
Corpus ID: 37150143
Proof. SAT is in NP (easy). To prove NP-hardness, we will show that Circuit-SAT is reducible to SAT. Let C be an arbitrary…
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
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
2009
2009
A Novel Circuit SAT Solver in Unbounded Model Checking: A Novel Circuit SAT Solver in Unbounded Model Checking
Yang Zhao
,
Lv Tao
,
Hua-wei Li
,
Xiao-wei Li
2009
Corpus ID: 60793032
2005
2005
Sequential equivalence checking based on k-th invariants and circuit SAT solving
Feng Lu
,
K. Cheng
Tenth IEEE International High-Level Design…
2005
Corpus ID: 15468063
In this paper, we first present the concept of the k-th invariant. In contrast to the traditional invariants that hold for all…
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
2005
2005
A polynomial-time heuristic for Circuit-SAT
Francesco Capasso
arXiv.org
2005
Corpus ID: 12854754
In this paper is presented an heuristic that, in polynomial time and space in the input dimension, determines if a circuit…
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
2001
2001
Improving Propositional Satisfiability Algorithms by Dyna mic Selection of Branching Rules
Marc Herbstritt
2001
Corpus ID: 18880911
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer…
Expand