Unsatisfiability

Unsatisfiability is the property of a propositional formula for which no truth assignment to its variables satisfies the formula, distinguishing it from satisfiable formulas that admit at least one satisfying assignment.

182

Publications

9.7K

Citations

335

Authors

201

Institutions

Publications per year

2017–2026

19

Authors

335

  1. JM
    João Marques‐Silva

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

    11 publications · 485 citations

    11

    h-index

  2. DA
    Dimitris Achlioptas

    Microsoft (United States), United States

    7 publications · 533 citations

    7

    h-index

  3. CM
    Cristopher Moore

    Santa Fe Institute, United States

    5 publications · 137 citations

    5

    h-index

  4. SS
    Stefan Szeider

    TU Wien, Austria

    5 publications · 224 citations

    5

    h-index

  5. OK
    Oliver Kullmann

    Swansea University, United Kingdom

    5 publications · 209 citations

    5

    h-index

1–5 of 335

Venues

  1. Random Structures and Algorithms

    8 publications · 422 citations

    8

    h-index

  2. Journal of the ACM

    JACM · 6 publications · 687 citations

    6

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 157 citations

    5

    h-index

  4. Combinatorics Probability Computing

    4 publications · 93 citations

    4

    h-index

  5. Discrete Applied Mathematics

    4 publications · 169 citations

    4

    h-index

1–5