Linear programs in a simple reversible language

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 2063-2074

  Matos, Armando B ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Group of modular matrices; Loop languages; Reversibility

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; RECURSIVE FUNCTIONS;

ALGEBRAIC STRUCTURES; EXTENDED VERSIONS; HOMOGENEOUS PROGRAM; LINEAR PROGRAMS; REVERSIBILITY; REVERSIBLE TRANSFORMATION;

LINEAR TRANSFORMATIONS;

EID: 85009224920     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00486-3     Document Type: Article

References (9)

1. [1] Bennett, C.H., Logical reversibility of computation. IBM J. Res. Develop. 6 (1973), 525–532.
2. [2] Bennett, C.H., The thermodynamics of computation—a review. Internat. J. Theoret. Phys. 21 (1982), 905–940.
3. [3] Hua, L.K., Introduction to Number Theory, 1982, Springer, Berlin.
4. n où. θ est un “isomorphisme de codes”. Comptes Rendus Hebdomadaires des Séances de L'Académie des Sciences 257 (1963), 2597–2600.
5. [5] Li, M., Tromp, J., Vitányi, P., Reversible simulation of irreversible computation. Physica D 120 (1998), 168–176.
6. [6] A.R. Meyer, D.M. Ritchie, The complexity of loop programs, Proc. 22nd National Conf. of the ACM, 1967, pp. 465–469.
7. [7] A.R. Meyer, D.M. Ritchie, Computational complexity and program structure, IBM Research Report RC 1817, 1967.
8. [8] Sommerhalder, R., van Westrhenen, S.C., The Theory of Computability: Programs, Machines, Effectiveness and Feasibility, International Computer Science Series, 1988, Addison-Wesley, Reading, MA.
9. [9] Tsichritzis, D., The equivalence problem of simple programs. J. Assoc. Comput. Mach. 17:4 (1970), 729–738.