5 search results - page 1 / 1 » A Polynomial Time Nilpotence Test for Galois Groups and Rela... |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
FOCS
1992
IEEE
13 years 8 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
STOC
2004
ACM
14 years 4 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
DM
2006
13 years 4 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...