2446 search results - page 38 / 490 » Choiceless Polynomial Time |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
FPL
2003
Springer
14 years 24 days ago
2003
Springer
This paper presents a method for evaluating functions in hardware based on polynomial approximation with non-uniform segments. The novel use of nonuniform segments enables us to ap...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
With OWL 2 about to be completed, it is the right time to start discussions on possible future modifications of OWL. We present here a number of suggestions in order to discuss th...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...