3690 search results - page 124 / 738 » Computation with classical sequents |
SIAMDM
2011
14 years 4 months ago
2011
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associat...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
ISPAN
2005
IEEE
15 years 3 months ago
2005
IEEE
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
MOC
2011
14 years 4 months ago
2011
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues assoc...
120
click to vote
PODC
2012
ACM
13 years 11 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...