33 search results - page 1 / 7 » The Complexity of Counting Problems in Equational Matching |
CADE
1994
Springer
13 years 11 months ago
1994
Springer
NN
1998
Springer
13 years 6 months ago
1998
Springer
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
COCO
1998
Springer
13 years 11 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
STACS
2007
Springer
14 years 28 days ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
ICFP
2008
ACM
14 years 6 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...