COLT
1997
Springer
14 years 8 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
COCO
1997
Springer
14 years 8 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
COCO
1997
Springer
14 years 8 months ago
1997
Springer
COCO
1997
Springer
14 years 8 months ago
1997
Springer
COCO
1997
Springer
14 years 8 months ago
1997
Springer
COCO
1997
Springer
14 years 8 months ago
1997
Springer
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
COCO
1997
Springer
14 years 8 months ago
1997
Springer
CIAC
1997
Springer
14 years 8 months ago
1997
Springer
d abstract) G. Liotta1, R. Tamassia2, I. G. Tollis3, P. Vocca4 1 Dipartimento di Informatica e Sistemistica, Universita di Roma \La Sapienza", via Salaria 113, 00198 Rome, Ita...
CIAC
1997
Springer
14 years 8 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
CIAC
1997
Springer
14 years 8 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...