16 search results - page 1 / 4 » On the Boolean Connectivity Problem for Horn Relations |
SAT
2007
Springer
13 years 11 months ago
2007
Springer
COCOON
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
DIS
2003
Springer
13 years 10 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...