Tree Size by Partial Backtracking
- 1 November 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (4) , 481-491
- https://doi.org/10.1137/0207038
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplicationsBulletin of the American Mathematical Society, 1976
- Backtrack programming techniquesCommunications of the ACM, 1975
- Estimating the efficiency of backtrack programsMathematics of Computation, 1975
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- A note on sampling a tape-fileCommunications of the ACM, 1962
- Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital ComputersJournal of the American Statistical Association, 1962