1559 search results - page 6 / 312 » Some Group Theory Problems |
LICS
1999
IEEE
15 years 3 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
81
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
MOC
2002
14 years 10 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
131
click to vote
LICS
2000
IEEE
15 years 3 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...