δ-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

Source URL: scungao.github.io

• 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

Gap Amplification Fails Below 1/2 Andrej Bogdanov June 1, 2005 Abstract The gap amplification lemma of Dinur (ECCC TR05-46) states that the satisfiability gap

Source URL: www.cse.cuhk.edu.hk

Hard instances for satisfiability and quasi-one-way functions Andrej Bogdanov ∗ Kunal Talwar† Andrew Wan‡

Source URL: www.cse.cuhk.edu.hk

1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

Source URL: algo2017.ac.tuwien.ac.at

Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma

Source URL: www2.ims.nus.edu.sg

SATISFIABILITY, BRANCH-WIDTH AND TSEITIN TAUTOLOGIES Michael Alekhnovich and Alexander Razborov August 24, 2011

Source URL: people.cs.uchicago.edu

Variant-Based Decidable Satisfiability in Initial Algebras with Predicates Ra´ ul Guti´errez1 1 DSIC, 2 University

Source URL: www.sci.unich.it

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Checking Full Satisfiability of Conceptual Models⋆ Alessandro Artale, Diego Calvanese, and Ang´elica Ib´an ˜ez-Garc´ıa

Source URL: ceur-ws.org

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, The Complexity of Satisfiability for Sub-Boolean Fragments of ALC Arne Meier1 and Thomas Schneider2 1

Source URL: ceur-ws.org

Satisfiability in EL with sets of Probabilistic ABoxes⋆ Marcelo Finger, Renata Wassermann, and Fabio G. Cozman University of S˜ ao Paulo, S˜ ao Paulo, Brazil

Source URL: ceur-ws.org