1257 search results - page 68 / 252 » A generalization of Euler's constant |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
MMB
2004
Springer
14 years 2 months ago
2004
Springer
Auctions are a well-established mechanism for efficient allocation of scarce resources and as such have already become a standard approach for pricing QoS-enabled future Internet ...