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… (More)
Wikipedia

Related topics

Related topics

11 relations
Boolean circuitBoolean satisfiability problemConjunctive normal formCook–Levin theorem
(More)

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfiability over a large field… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2013
2013
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits
We give a nontrivial algorithm for the satisfiability problem for threshold circuits of depth two with a linear number of wires… (More)
Is this relevant?
2013
2013
Exact Complexity and Satisfiability - (Invited Talk)
All NP-complete problems are equivalent as far as polynomial time solvability is concerned. However, their exact complexities… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Non-uniform ACC Circuit Lower Bounds
  • Ryan Williams
  • IEEE 26th Annual Conference on Computational…
  • 2011
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD$m$ gates, where $m > 1… (More)
Is this relevant?
2011
2011
A Satisfiability Algorithm for AC$^0$
We consider the problem of efficiently enumerating the satisfying assignments to AC circuits. We give a zeroerror randomized… (More)
Is this relevant?
2010
2010
On the complexity of circuit satisfiability
In this paper, we are concerned with the exponential complexity of the Circuit Satisfiability (CktSat) problem and more generally… (More)
Is this relevant?
2007
2007
The decision problem : Solvable classes of quantificational formulas
1. What is the decision problem in question? The original problem was to find an algorithm deciding logical validity of sentences… (More)
Is this relevant?
2007
2007
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean form ula is proposed. It makes an original use of the concept of… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Circuit SAT Solver With Signal Correlation Guided Learning
Boolean Satistifiability has attracted tremendous research effort in recent years, resulting in the developments of various… (More)
  • figure 1
  • figure 2
  • table III
  • table II
  • table IV
Is this relevant?
2000
2000
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In… (More)
  • figure 1
  • figure 4
  • table 1
  • table 2
  • table 3
Is this relevant?