484 search results - page 74 / 97 » Computing Hilbert Class Polynomials |
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
TCS
2010
13 years 5 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
CRYPTO
2001
Springer
14 years 1 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...