Springer Nature
Discrete geometry and geometric computation
MSC2020 · 68R07
Computational aspects of satisfiability
Computational aspects of satisfiability [See also 68T20]
0 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Mapped problems
No published problems have been assigned to this subject yet. Related articles below are a starting point for review.
Journals & articles in MSC 68
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
SIAM
Theory of computation
SIAM
Applied and computational mathematics reviews
- The complexity of propositional proofs
2007 · 2 questions extracted
- Randomized numerical linear algebra: Foundations and algorithms
2020 · 0 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 177