most citedLaconic schema mappings: computing core universal solutions by means of SQL queries

17 citations · 17 across the 2 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2006

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

Parikshit Gopalan, Phokion G. Kolaitis, Elitza Maneva +1

Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisf…