787 search results - page 86 / 158 » Polynomial Constants are Decidable |
CIAC
1997
Springer
14 years 1 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
DAGSTUHL
2007
13 years 10 months ago
2007
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
ICISC
2004
13 years 10 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...