4403 search results - page 161 / 881 » Galois Theory of Algorithms |
164
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
175
click to vote
MST
2010
15 years 1 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
173
click to vote
ECCC
2011
14 years 10 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
181
click to vote
TVCG
2012
13 years 8 months ago
2012
—The broad goals of verifiable visualization rely on correct algorithmic implementations. We extend a framework for verification of isosurfacing implementations to check topologi...
144
click to vote
ISSAC
2007
Springer
16 years 16 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...