494 search results - page 23 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
AAAI
2004
13 years 9 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
WDAG
2010
Springer
13 years 6 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...