Libri sul tema "Complexité de circuits"

Jukna, Stasys. Tropical Circuit Complexity. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-42354-3.

Vollmer, Heribert. Introduction to Circuit Complexity. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03927-4.

Håstad, Johan. Computational limitations of small-depth circuits. Cambridge, Mass: MIT Press, 1987.

Vollmer, Heribert. Introduction to Circuit Complexity: A Uniform Approach. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999.

Straubing, Howard. Finite Automata, Formal Logic, and Circuit Complexity. Boston, MA: Birkhäuser Boston, 1994. http://dx.doi.org/10.1007/978-1-4612-0289-9.

Straubing, Howard. Finite automata, formal logic, and circuit complexity. Boston: Birkhäuser, 1994.

Subramanian, Ashok. The computational complexity of the circuit value and network stability problems. Stanford, Calif: Dept. of Computer Science, Stanford University, 1990.

Sridharan, K., B. Srinivasu e Vikramkumar Pudi. Low-Complexity Arithmetic Circuit Design in Carbon Nanotube Field Effect Transistor Technology. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-50699-5.

IEEE, Conference on Computational Complexity (11th 1996 Philadelphia Penn ). Proceedings, Eleventh Annual IEEE Conference on Computational Complexity: May 24-27, 1996, Philadelphia, Pennsylvania. Los Alamitos, Calif: IEEE Computer Society Press, 1996.

Myasnikov, Alexei G. Non-commutative cryptography and complexity of group-theoretic problems. Providence, R.I: American Mathematical Society, 2011.

Haris, Skokos, a cura di. Complex Hamiltonian dynamics. Heidelberg: Springer, 2012.

Sasao, Tsutomu. Representations of Discrete Functions. Boston, MA: Springer US, 1996.

Deschamps, Jean-Pierre. Guide to FPGA Implementation of Arithmetic Functions. Dordrecht: Springer Netherlands, 2012.

Keating, Michael. Simple art of SoC design: Closing the gap between RTL and ESL. New York: Springer, 2011.

service), SpringerLink (Online, a cura di. Complex Time-Delay Systems: Theory and Applications. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.

Braulio, García-Cámara, Prieto Manuel, Ruggiero Martino, Sicard Gilles e SpringerLink (Online service), a cura di. Integrated Circuit and System Design. Power and Timing Modeling, Optimization, and Simulation: 21st International Workshop, PATMOS 2011, Madrid, Spain, September 26-29, 2011. Proceedings. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.

Järvisalo, Matti. Theory and Applications of Satisfiability Testing – SAT 2013: 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Rainer, Dahlhaus, a cura di. Mathematical methods in signal processing and digital image analysis. Berlin: Springer, 2008.

International Conference Arithmetic, Geometry, Cryptography and Coding Theory (14th 2013 Marseille, France). Algorithmic arithmetic, geometry, and coding theory: 14th International Conference, Arithmetic, Geometry, Cryptography, and Coding Theory, June 3-7 2013, CIRM, Marseille, France. A cura di Ballet Stéphane 1971 editor, Perret, M. (Marc), 1963- editor e Zaytsev, Alexey (Alexey I.), 1976- editor. Providence, Rhode Island: American Mathematical Society, 2015.

Alta.) WIN (Conference) (2nd 2011 Banff. Women in Numbers 2: Research directions in number theory : BIRS Workshop, WIN2 - Women in Numbers 2, November 6-11, 2011, Banff International Research Station, Banff, Alberta, Canada. A cura di David Chantal 1964-, Lalín Matilde 1977- e Manes Michelle 1970-. Providence, Rhode Island: American Mathematical Society, 2013.

Leighton, Frank Thomson. Complexity Issues in VLSI. The MIT Press, 2003.

Steele, Vaughn R., Vani Pariyadath, Rita Z. Goldstein e Elliot A. Stein. Reward Circuitry and Drug Addiction. A cura di Dennis S. Charney, Eric J. Nestler, Pamela Sklar e Joseph D. Buxbaum. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780190681425.003.0044.

Parberry, Ian. Circuit Complexity and Neural Networks. The MIT Press, 1994. http://dx.doi.org/10.7551/mitpress/1836.001.0001.

Circuit complexity and neural networks. Cambridge, Mass: MIT Press, 1994.

Parberry, Ian. Circuit Complexity and Neural Networks. MIT Press, 2018.

Chaos and Complexity in Nonlinear Electronic Circuits. World Scientific Publishing Company, 1997.

Ogorzalek, Maciej J. Chaos and Complexity in Nonlinear Electronic Circuits. World Scientific Publishing Co Pte Ltd, 1997.

Chaos and Complexity in Nonlinear Electronic Circuits. World Scientific Publishing Co Pte Ltd, 1997.

Kushilevitz, Eyal, e Noam Nisan. Communication Complexity. Cambridge University Press, 2011.

Kushilevitz, Eyal, e Noam Nisan. Communication Complexity. Cambridge University Press, 2006.

Kushilevitz, Eyal, e Noam Nisan. Communication Complexity. Cambridge University Press, 2009.

Drechsler, Rolf, e Nabila Abdessaied. Reversible and Quantum Circuits: Optimization and Complexity Analysis. Springer International Publishing AG, 2016.

Drechsler, Rolf, e Nabila Abdessaied. Reversible and Quantum Circuits: Optimization and Complexity Analysis. Springer London, Limited, 2016.

Drechsler, Rolf, e Nabila Abdessaied. Reversible and Quantum Circuits: Optimization and Complexity Analysis. Springer, 2018.

Straubing, Howard. Finite Automata, Formal Logic, and Circuit Complexity. Birkhauser Verlag, 2012.

Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser Boston, 2012.

Tropical Circuit Complexity: Limits of Pure Dynamic Programming. Springer International Publishing AG, 2023.

Karchmer, Mauricio. Communication Complexity: A New Approach to Circuit Depth. The MIT Press, 1989.

Communication complexity: A new approach to circuit depth. Cambridge, Mass: MIT Press, 1989.

Lee, David. Contributions to information-based complexity, image understanding, and logic circuit design. 1986.

Sridharan, K., Vikramkumar Pudi e B. Srinivasu. Low-Complexity Arithmetic Circuit Design in Carbon Nanotube Field Effect Transistor Technology. Springer International Publishing AG, 2020.

Sridharan, K., Vikramkumar Pudi e B. Srinivasu. Low-Complexity Arithmetic Circuit Design in Carbon Nanotube Field Effect Transistor Technology. Springer International Publishing AG, 2021.

Kuhn, Peter. Algorithms, complexity analysis and VLSI architectures for MPEG-4 motion estimation. 1999.

Boolean Function Complexity Advances And Frontiers. Springer, 2012.

Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series). Springer, 1999.

Jukna, Stasys. Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics Book 27). Springer, 2012.

Tee, Louis Y., e Guoping Feng. Mutant Mouse Models of OCD. A cura di Christopher Pittenger. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780190228163.003.0033.

Bountis, Tassos, e Haris Skokos. Complex Hamiltonian Dynamics. Springer Berlin / Heidelberg, 2014.

Bountis, Tassos, e Haris Skokos. Complex Hamiltonian Dynamics. Springer, 2012.

Paus, Tomáš. Combining brain imaging with brain stimulation: causality and connectivity. A cura di Charles M. Epstein, Eric M. Wassermann e Ulf Ziemann. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780198568926.013.0034.