Theory and Applications of Models of Computation [electronic resource] : 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011, Proceedings /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 6648Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 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 title; Printed edition:: No titleDDC classification:

004.0151 23

LOC classification:

QA75.5-76.95

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

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.