Search Results for author:
Found 5 papers, 0 papers with code
On the Expressive Power of Homomorphism Counts
In this paper, we embark on a study of the restrictions of the right profile by investigating relaxations of isomorphism that can or cannot be captured by restricting the right profile to a fixed class of graphs.
Combinatorics Logic in Computer Science F.4.1; G.2.2; I.1.2
Structure and Complexity of Bag Consistency
In a by-now classical paper, Beeri, Fagin, Maier, and Yannakakis established several different equivalent characterizations of acyclicity; in particular, they showed that the sets of attributes of a schema form an acyclic hypergraph if and only if the local-to-global consistency property for relations over that schema holds, which means that every collection of pairwise consistent relations over the schema is globally consistent.
Databases
Clique Is Hard on Average for Regular Resolution
We prove that for $k \ll \sqrt[4]{n}$ regular resolution requires length $n^{\Omega(k)}$ to establish that an Erd\H{o}s-R\'enyi graph with appropriately chosen edge density does not contain a $k$-clique.
Computational Complexity
Relative Entailment Among Probabilistic Implications
By exploiting a previously noted alternative view of the entailment in terms of linear programming duality, we characterize exactly the cases of entailment from arbitrary numbers of premises, again both in the stand-alone case and in the case of presence of additional classical implications.
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts.
