Fundamentals of Computation Theory [electronic resource] : 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings / edited by Adrian Kosowski, Igor Walukiewicz.
Contributor(s): Kosowski, Adrian [editor.]
| Walukiewicz, Igor [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 9210Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Edition: 1st ed. 2015.Description: XIX, 395 p. 61 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319221779.Subject(s): Algorithms | Computer networks | Computer science | Computer science -- Mathematics | Discrete mathematics | Software engineering | Algorithms | Computer Communication Networks | Computer Science Logic and Foundations of Programming | Discrete Mathematics in Computer Science | Software EngineeringAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms; complexity and Boolean functions; languages; set algorithms, covering, and traversal; graph algorithms and networking applications; anonymity and indistinguishability; graphs, automata, and dynamics; and logic and games.
This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms; complexity and Boolean functions; languages; set algorithms, covering, and traversal; graph algorithms and networking applications; anonymity and indistinguishability; graphs, automata, and dynamics; and logic and games.
There are no comments for this item.