American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(68A20) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 13 of 13 found      Go to page: 1

[1] L. Auslander and R. Tolimieri. Is computing with the finite Fourier transform pure or applied mathematics?. Bull. Amer. Math. Soc. 1 (1979) 847-897. MR 546312.
Abstract, references, and article information   
View Article: PDF

[2] Roger Chalkley. The perfect $n$th power which divides a nonzero polynomial . Proc. Amer. Math. Soc. 68 (1978) 147-148. MR 0466088.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[3] D. P. McCarthy. The optimal algorithm to evaluate $x\sp{n}$ using elementary multiplication methods . Math. Comp. 31 (1977) 251-256. MR 0428791.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[4] F. P. Preparata and D. V. Sarwate. Computational complexity of Fourier transforms over finite fields . Math. Comp. 31 (1977) 740-751. MR 0436662.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[5] L. H. Harper. An $n\log n$ lower bound on synchronous combinational complexity . Proc. Amer. Math. Soc. 64 (1977) 300-306. MR 0456962.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[6] Robert T. Moenck. On the efficiency of algorithms for polynomial factoring . Math. Comp. 31 (1977) 235-250. MR 0422193.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[7] A. S. Fraenkel and Y. Yesha. Theory of annihilation games. Bull. Amer. Math. Soc. 82 (1976) 775-777. MR 0449726.
Abstract, references, and article information   
View Article: PDF

[8] Nimrod Megiddo. Partial and complete cyclic orders. Bull. Amer. Math. Soc. 82 (1976) 274-276. MR 0404065.
Abstract, references, and article information   
View Article: PDF

[9] Nancy Ann Lynch, Albert R. Meyer and Michael J. Fischer. Relativization of the theory of computational complexity . Trans. Amer. Math. Soc. 220 (1976) 243-287. MR 0403933.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[10] Julian D. Laderman. A noncommutative algorithm for multiplying $3 \times 3$ matrices using 23 multiplications. Bull. Amer. Math. Soc. 82 (1976) 126-128. MR 0395320.
Abstract, references, and article information   
View Article: PDF

[11] Donald E. Knuth. Estimating the efficiency of backtrack programs . Math. Comp. 29 (1975) 122-136. MR 0373371.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[12] W. M. Gentleman and S. C. Johnson. The evaluation of determinants by expansion by minors and the general problem of substitution . Math. Comp. 28 (1974) 543-548. MR 0373369.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[13] Paul Young. Easy constructions in complexity theory: Gap and speed-up theorems . Proc. Amer. Math. Soc. 37 (1973) 555-563. MR 0312768.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 1 to 13 of 13 found      Go to page: 1