Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9210)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: FCT 2015.
Buy print copy
About this book
Similar content being viewed by others
Keywords
- Algorithm design
- Approximation
- Automata and formal languages
- Cloud computing
- Combinatorics
- Computational biology
- Computational complexity
- Computational geometry
- Distributed computing
- Evolving systems
- Formal methods
- Hybrid systems
- Logics
- Model checking
- Online algorithms
- Optimization
- Parallel computing
- Quantum computing
- Ubiquitous systems
- Verification
Table of contents (29 papers)
-
Geometry, Combinatorics, Text Algorithms
-
Complexity and Boolean Functions
Other volumes
-
Fundamentals of Computation Theory
Editors and Affiliations
Bibliographic Information
Book Title: Fundamentals of Computation Theory
Book Subtitle: 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings
Editors: Adrian Kosowski, Igor Walukiewicz
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-22177-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-22176-2Published: 12 August 2015
eBook ISBN: 978-3-319-22177-9Published: 03 August 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIX, 395
Number of Illustrations: 61 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Computer Communication Networks, Logics and Meanings of Programs, Discrete Mathematics in Computer Science, Software Engineering