1383 search results - page 83 / 277 » On the Complexity of the Interlace Polynomial |
147
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
205
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
162
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
195
click to vote
EC
2008
15 years 5 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
131
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...