On splitting sets in block designs and finding roots of polynomials
- 15 August 1990
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 84 (1) , 71-85
- https://doi.org/10.1016/0012-365x(90)90274-l
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A geometric approach to root finding in GT(q/sup m/)IEEE Transactions on Information Theory, 1989
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)IEEE Transactions on Information Theory, 1986
- Efficient decentralized consensus protocolsIEEE Transactions on Software Engineering, 1986
- A fast parallel algorithm for the maximal independent set problemJournal of the ACM, 1985
- Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomialsIEEE Transactions on Information Theory, 1983
- Probabilistic algorithms in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- On the efficiency of algorithms for polynomial factoringMathematics of Computation, 1977
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970