Two results on polynomial-time reducibilities

Abstract

have independently observed that the 0(n3/log n) bound of the Four Russians' Algorithm can be improved upon by a strategy which pre-computes and looks up products of small matrices.

DOI: 10.1145/1008591.1008594

Cite this paper

@inproceedings{Simon1976TwoRO, title={Two results on polynomial-time reducibilities}, author={Istv{\'a}n Simon}, booktitle={SIGA}, year={1976} }