9 search results - page 1 / 2 » Certifying Solutions to Permutation Group Problems |
CADE
2003
Springer
14 years 4 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
STOC
1987
ACM
13 years 7 months ago
1987
ACM
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
ASIACRYPT
2007
Springer
13 years 10 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
TSP
2008
13 years 4 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...