On the computational complexity of conservative computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 92-112

  Mauri, Giancarlo ^a   Leporati, Alberto ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK ANALYSIS; FORMAL LOGIC; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

APPROXIMATE SOLUTION; COMPUTATIONAL POWER; COMPUTER EXPERIMENT; CONSERVATIVE LOGIC; INTERNAL ENERGIES; MATHEMATICAL PROPERTIES; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME HEURISTICS;

LOGIC CIRCUITS;

EID: 35248846546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_5     Document Type: Article

References (23)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, 1999.
2. R. Beigel, J. Tarui. On ACC. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 783-792.
3. C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 17, November 1973, pp. 525-532.
4. G. Cattaneo, G. Della Vedova, A. Leporati, R. Leporini. Towards a Theory of Conservative Computing. Submitted for publication, 2002. e-print available at: http://arxiv.org/quant-ph/abs/0211085
5. G. Cattaneo, A. Leporati, R. Leporini. Fredkin Gates for Finite-valued Reversible and Conservative Logics. Journal of Physics A: Mathematical and General, 35, 2002, pp. 9755-9785.
6. E. Fredkin, T. Toffoli. Conservative Logic. International Journal of Theoretical Physics, 21, Nos. 3/4, 1982, pp. 219-253.
7. M. R. Garey, D. S. Johnson. Computers and Intractability. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, 1979.
8. M. Goldmann, J. Håstad, A. Razborov. Majority Gates vs. general weighted Threshold Gates. Computational Complexity, Vol. 2, No. 4, 1992, pp. 277-300.
9. A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán. Threshold Circuits of Bounded Depth. Journal of Computer and System Sciences, Vol. 46, No. 2, 1993, pp. 129-154.
10. J. Håstad, M. Goldmann. On the power of small-depth threshold circuits. Computational Complexity I, Vol. 2, 1991, pp. 113-129.
11. R. Landauer. Irreversibility and heat generation in the computing process. IBM Journal of Research and Development, 3, 1961, pp. 183-191.
12. A. Leporati, G. Della Vedova, G. Mauri. An Experimental Study of some Heuristics for Min Storage. Submitted for publication, 2003.
13. S. Muroga. Threshold Logic and its Applications. Wiley-Interscience, 1971.
14. rd Colloquium über Automatentheorie (Hannover, 1965), Birkhäuser Verlag, Basel, 1967, pp. 121-140.
15. English translation: Fundamentals of the Representation of Discrete Processes, ISF Report 82.04, 1982.
16. Ω(log n) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom. Information Processing Letters, Vol. 45, No. 6, 1993, pp. 303-307.
17. N. Rescher. Many-valued logics. McGraw-Hill, 1969.
18. J. B. Rosser, A. R. Turquette. Many-valued logics. North Holland, 1952.
19. V. P. Roychowdhury, K. Y. Siu, A. Orlitsky. Theoretical Advances in Neural Computation and Learning. Kluwer Academic, 1994.
20. K. Y. Siu, J. Bruck. On the Power of Threshold Circuits with Small Weights. SIAM Journal on Discrete Mathematics, Vol. 4, No. 3, 1991, pp. 423-435.
21. K. Y. Siu, V. P. Roychowdhury. On Optimal Depth Threshold Circuits for Multiplication and Related Problems. SIAM Journal on Discrete Mathematics, Vol. 7, No. 2, 1994, pp. 284-292.
22. H. Vollmer. Introduction to Circuit Complexity: A Uniform Approach. Springer-Verlag, 1999.
23. A. C. Yao. On ACC and Threshold Circuits. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 619-628.