1379 search results - page 180 / 276 » The Complexity of the Annihilating Polynomial |
165
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
149
click to vote
TAPSOFT
1991
Springer
15 years 10 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
170
click to vote
AIPS
2007
15 years 8 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
150
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
170
click to vote
AIPS
2008
15 years 8 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...