217 search results - page 15 / 44 » A new upper bound on the cyclic chromatic number |
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
CTRSA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
WCET
2007
13 years 8 months ago
2007
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
COMBINATORICS
2004
13 years 7 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...