494 search results - page 22 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
173
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
176
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
197
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
165
click to vote
FOCS
2007
IEEE
16 years 27 days ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
182
click to vote
WG
2005
Springer
16 years 1 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...