7796 search results - page 362 / 1560 » On Generalized Schur Numbers |
197
click to vote
ASIACRYPT
2007
Springer
16 years 1 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
193
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
210
click to vote
PLDI
2006
ACM
16 years 25 days ago
2006
ACM
The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficul...
167
click to vote
PODC
2006
ACM
16 years 25 days ago
2006
ACM
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
200
Voted
PODC
2006
ACM
16 years 25 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...