Theory and Applications of Models of Computation [electronic resource] :8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings / edited by Mitsunori Ogihara, Jun Tarui.
by Ogihara, Mitsunori [editor.]; Tarui, Jun [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 6648Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011.Description: XVI, 564 p. online resource.ISBN: 9783642208775.Subject(s): Computer science | Information theory | Computer software | Logic design | Computational complexity | Computer Science | Theory of Computation | Mathematics of Computing | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Discrete Mathematics in Computer ScienceDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer eBooksSummary: This book constitutes the refereed proceedings of the 8th International Conference on Theory and Applications of Models of Computation, TAMC 2011, held in Tokyo, Japan, in May 2011. The 51 revised full papers presented together with the abstracts of 2 invited talks were carefully reviewed and selected from 136 submissions. The papers address the three main themes of the conference which were computability, complexity, and algorithms and are organized in topical sections on general algorithms, approximation, graph algorithms, complexity, optimization, circuit complexity, data structures, logic and formal language theory, games and learning theory, and cryptography and communication complexity.
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA75.5-76.95 (Browse shelf) | Available |
This book constitutes the refereed proceedings of the 8th International Conference on Theory and Applications of Models of Computation, TAMC 2011, held in Tokyo, Japan, in May 2011. The 51 revised full papers presented together with the abstracts of 2 invited talks were carefully reviewed and selected from 136 submissions. The papers address the three main themes of the conference which were computability, complexity, and algorithms and are organized in topical sections on general algorithms, approximation, graph algorithms, complexity, optimization, circuit complexity, data structures, logic and formal language theory, games and learning theory, and cryptography and communication complexity.
There are no comments for this item.