# Circuit satisfiability problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- ASIACRYPT
- 2017

We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfiability over a large fieldâ€¦Â (More)

Is this relevant?

2013

2013

- IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

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

- IPEC
- 2013

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

- 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

- ArXiv
- 2011

We consider the problem of efficiently enumerating the satisfying assignments to AC circuits. We give a zeroerror randomizedâ€¦Â (More)

Is this relevant?

2010

2010

- STOC
- 2010

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

- 2007

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

- SAT
- 2007

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)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- DATE
- 2003

Boolean Satistifiability has attracted tremendous research effort in recent years, resulting in the developments of variousâ€¦Â (More)

Is this relevant?

2000

2000

- Computational Logic
- 2000

Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. Inâ€¦Â (More)

Is this relevant?