2200 search results - page 72 / 440 » Bloch's Constant is Computable |
SODA
2012
ACM
13 years 12 days ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
SIGGRAPH
1993
ACM
15 years 2 months ago
1993
ACM
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...