1650 search results - page 150 / 330 » The HOM problem is decidable |
128
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
121
click to vote
FEWS
2007
15 years 5 months ago
2007
Many organizations face every day the problem of effectively managing their contacts (customers, suppliers, partners, etc.), in terms of communication, clustering, networking, ana...
160
click to vote
GVD
2004
15 years 5 months ago
2004
Abstract. Checking the consistency of query conditions is an old problem, and there are already many proposed solutions. Since the problem is in general undecidable, there is not a...
140
click to vote
UAI
2003
15 years 5 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
132
click to vote
IJCAI
1989
15 years 5 months ago
1989
This paper addresses two problems concerning the issue of redundant information in resolution based reasoning systems. The first one deals with the question, how the derivation of...