We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Hypergraphs are a very powerful tool and can represent many problems. In this paper we define a new image representation based on hypergraphs. This representation conducts to a n...