1650 search results - page 122 / 330 » The HOM problem is decidable |
130
click to vote
IPL
2007
15 years 4 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
107
click to vote
DCG
2000
15 years 4 months ago
2000
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
151
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
117
click to vote
SOFTWARE
2002
15 years 3 months ago
2002
We present a new approach to test selection in sequential diagnosis (or classification) in the independence Bayesian framework that resembles the hypothetico-deductive approach to ...
103
click to vote
DM
2008
15 years 3 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...