论文信息 - Relative complexity of operations on numeric and bit-string algebras

Relative complexity of operations on numeric and bit-string algebras

Sets of primitive operations for algebras with numerical and bit string domains are classified according to their computational efficiency. The relative complexity of certain basic operations on such algebras is determined.

Nancy A. Lynch | Edward K. Blum

[1] Nancy A. Lynch. Straight-line program length as a parameter for complexity measures , 1978, STOC '78.

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] Nancy A. Lynch,et al. Efficient reducibility between programming systems (Preliminary Report) , 1977, STOC '77.

[4] Ashok K. Chandra. Efficient Compilation of Linear Recursive Programs , 1973, SWAT.

[5] George Gratzer,et al. Universal Algebra , 1979 .

[6] Joel I. Seiferas,et al. New Real-Time Simulations of Multihead Tape Units , 1977, JACM.

[7] Denis J. Kfoury. Comparing Algebraic Structures up to Algorithmic Equivalence , 1972, ICALP.

[8] Arnold L. Rosenberg,et al. Real-Time Simulation of Multihead Tape Units , 1972, JACM.

[9] Nancy A. Lynch,et al. Relative complexity of algebras , 1981, Mathematical systems theory.

[10] Nancy A. Lynch,et al. A difference in expressive power between flowcharts and recursion schemes , 2005, Mathematical systems theory.