Amazon cover image
Image from Amazon.com

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: Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 6648Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XVI, 564 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642208775
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 004.0151 23
LOC classification:
  • QA75.5-76.95
Online resources: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-Book E-Book Central Library Available E-47882

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 on this title.

to post a comment.

Maintained by VTU Library