1772 search results - page 21 / 355 » Classifying Problems into Complexity Classes |
AAAI
2006
13 years 9 months ago
2006
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
JC
2000
13 years 7 months ago
2000
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
AAAI
1997
13 years 9 months ago
1997
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distan...