0 citations0 referencesGoogle Scholardoi.orgSMT-COMP: Satisfiability Modulo Theories CompetitionLecture notes in computer science·2005·pp. 20–23Citations Over TimeTop 10% of 2005 papersClark Barrett, Leonardo de Moura, Aaron StumpRelated Papers→ Tree-depth, quantifier elimination, and quantifier rank(2018)7 cited→ Quantifier Elimination For Tame Fields(2012)→ On some global semianalytic sets(2013)→ Quantifier elimination theory and maps which preserve semipositivity(2021)→ Quantifier Elimination(2020)