542 search results - page 23 / 109 » The Denjoy alternative for computable functions |
144
click to vote
COCO
1992
Springer
15 years 10 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
190
click to vote
EUROCRYPT
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
159
click to vote
ENTCS
2007
15 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
170
click to vote
TARK
2005
Springer
15 years 11 months ago
2005
Springer
The aggregation of conflicting preferences is an important issue in human society and multiagent systems. Due to its universality, voting among a set of alternatives has a centra...
240
click to vote
GRAPHICSINTERFACE
2011
14 years 9 months ago
2011
In traditional graphical user interfaces, the majority of UI elements are hidden to the user in the default view. Application designers and users desire more space for their appli...