Skip to search formSkip to main contentSkip to account menu

Circuit satisfiability problem

Known as: CIRCUIT-SAT, Circuit satisfiability, Circuit SAT 
In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Digital currencies like Bitcoin and other blockchain based systems provide means to record monetary transfers between accounts… 
2017
2017
The Black-Box Hypothesis, introduced by Barak et al. [5], states that any property of boolean functions decided efficiently (e.g… 
2014
2014
Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper… 
2010
2010
The subject of this dissertation belongs to the area known as classical Propositional Satisfiability. The Propositional… 
2010
2010
In this paper we describe a significant improvement to the justificationbased local search algorithm for circuit satisfiability… 
2009
2009
For the circuit-oriented SAT problems,general purpose SAT solver will make some unnecessary decision and implication. The reason… 
2007
2007
Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic… 
2007
2007
The paper proposes a robust circuit-based Boolean satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit… 
2005
2005
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes… 
2004
2004
In this work we give e(cid:14)cient molecular computing solutions to eight well-known NP-complete problems, namely the…