15033 search results - page 14 / 3007 » Complexity Theory and Algorithms |
AI
2003
Springer
15 years 2 months ago
2003
Springer
The Internet has opened opportunities for efficient on-line trading, and researchers have developed algorithms for various auctions, as well as exchanges for standardized commoditi...
68
Voted
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
JACM
2010
14 years 8 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
COCO
1995
Springer
15 years 1 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...