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.
Contributor(s): Ogihara, Mitsunori [editor.]
| Tarui, Jun [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6648Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XVI, 564 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642208775.Subject(s): Computer science | Computer science -- Mathematics | Algorithms | Machine theory | Discrete mathematics | Theory of Computation | Mathematics of Computing | Algorithms | Computer Science Logic and Foundations of Programming | Formal Languages and Automata Theory | Discrete Mathematics in Computer ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.