64 search results - page 12 / 13 » Integer Quadratic Quasi-polyhedra |
TCS
2011
13 years 1 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
ACISP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
EJC
2008
13 years 6 months ago
2008
Abstract. We give a classification of all equivelar polyhedral maps on the torus. In particular, we classify all triangulations and quadrangulations of the torus admitting a vertex...
TCS
2010
13 years 4 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
IACR
2011
12 years 5 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...