satisfiability modulo theories
Sign in to saveAlso known as SMT
problem of determining whether a mathematical formula is satisfiable
Wikidata facts
- Instance of
- decision problem
Show 1 more fact
- computational complexity
- NP-complete
Sources (3)
via Wikidata · CC0