Back to Results
First PageMeta Content
Theoretical computer science / Computability theory / Computational complexity theory / Theory of computation / Constructivism / Fourier analysis / Formal methods / Computable number / Computable analysis / Computable function / NC / Modulus of continuity


δ-Complete Decision Procedures for Satisfiability over the Reals⋆ Sicun Gao, Jeremy Avigad, and Edmund M. Clarke Carnegie Mellon University, Pittsburgh, PAAbstract. We introduce the notion of “δ-complete de
Add to Reading List

Document Date: 2018-08-09 17:19:27


Open Document

File Size: 323,30 KB

Share Result on Facebook
UPDATE