Circuit Satisfiability

Circuit Satisfiability is the computational decision problem that determines whether there exists a boolean assignment to the inputs of a given combinational logic circuit such that the output evaluates to true, distinguishing it as a canonical NP-complete problem in circuit complexity theory.

278

Publications

13.6K

Citations

542

Authors

225

Institutions

Publications per year

2017–2026

26

Variants

Csat

Authors

542

  1. RD
    Rolf Drechsler

    University of Bremen, Germany

    16 publications · 451 citations

    13

    h-index

  2. KA
    Karem A. Sakallah

    University of Michigan, United States

    10 publications · 535 citations

    10

    h-index

  3. SM
    Sharad Malik

    Princeton University, United States

    10 publications · 1.3K citations

    10

    h-index

  4. KC
    Kwang‐Ting Cheng

    University of California, Santa Barbara, United States

    9 publications · 337 citations

    9

    h-index

  5. JM
    João Marques‐Silva

    Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal

    9 publications · 364 citations

    9

    h-index

1–5 of 542

Venues

  1. 11

    h-index

  2. Design, Automation, and Test in Europe

    Conference · 6 publications · 179 citations

    6

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 6 publications · 136 citations

    6

    h-index

  4. 4

    h-index

  5. Journal of Computer and System Sciences

    4 publications · 85 citations

    4

    h-index

1–5