Fundamentals of Computation Theory : 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings / edited by Adrian Kosowski, Igor Walukiewicz.

Contributor(s):

Material type: Text

TextLanguage: İngilizce Series: Theoretical Computer Science and General Issues ; 9210Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Edition: 1st ed. 2015Description: 1 online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783319221779

Subject(s):

LOC classification:

QA76.9.A43

Online resources:

Springer eBooks Online access link to the resource

Summary: 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.

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

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Call number	Status	Notes	Date due	Barcode
E-Book	Merkez Kütüphane	Merkez Kütüphane	E-Kitap Koleksiyonu	QA76.9.A43EBK (Browse shelf(Opens below))	Geçerli değil-e-Kitap / Not applicable-e-Book			EBK00437

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

to post a comment.