- 4 Ergebnisse
Kleinster Preis: € 53,49, größter Preis: € 69,66, Mittelwert: € 62,14
1
Fundamentals of Computation Theory - Leszek Antoni GÄ?sieniec; Jesper Jansson; Christos Levcopoulos
Bestellen
bei Springer.com
€ 53,49
Versand: € 0,001
Bestellengesponserter Link
Leszek Antoni GÄ?sieniec; Jesper Jansson; Christos Levcopoulos:

Fundamentals of Computation Theory - neues Buch

2019, ISBN: 9783030250270

This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019. The 21 full papers … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
2
Fundamentals of Computation Theory - Leszek Antoni G?sieniec; Jesper Jansson; Christos Levcopoulos
Bestellen
bei Springer.com
€ 55,92
Bestellengesponserter Link

Leszek Antoni G?sieniec; Jesper Jansson; Christos Levcopoulos:

Fundamentals of Computation Theory - neues Buch

2019, ISBN: 9783030250270

This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019. The 21 full papers … Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
3
Bestellen
bei lehmanns.de
€ 69,66
Versand: € 0,001
Bestellengesponserter Link
Leszek Antoni Gasieniec; Jesper Jansson; Christos Levcopoulos:
Fundamentals of Computation Theory - neues Buch

2019

ISBN: 9783030250270

22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings, eBooks, eBook Download (EPUB), [PU: Springer International Publishing], Springer Internationa… Mehr…

Versandkosten:Download sofort lieferbar. (EUR 0.00)
4
Fundamentals of Computation Theory
Bestellen
bei eBook.de
€ 69,49
Versand: € 0,001
Bestellengesponserter Link
Fundamentals of Computation Theory - neues Buch

2019, ISBN: 9783030250270

Fundamentals of Computation Theory ab 69.49 EURO 22nd International Symposium FCT 2019 Copenhagen Denmark August 12-14 2019 Proceedings Medien > Bücher

Nr. 37749574. Versandkosten:, , DE. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - Fundamentals of Computation Theory


EAN (ISBN-13): 9783030250270
Erscheinungsjahr: 2019
Herausgeber: Springer International Publishing

Buch in der Datenbank seit 2019-09-07T12:03:25+02:00 (Vienna)
Detailseite zuletzt geändert am 2021-09-13T21:14:55+02:00 (Vienna)
ISBN/EAN: 9783030250270

ISBN - alternative Schreibweisen:
978-3-030-25027-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: jansson
Titel des Buches: fundamentals computation theory


Daten vom Verlag:

Autor/in: Leszek Antoni Gąsieniec; Jesper Jansson; Christos Levcopoulos
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
Verlag: Springer; Springer International Publishing
365 Seiten
Erscheinungsjahr: 2019-08-01
Cham; CH
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 365 p. 266 illus., 27 illus. in color.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Algorithmen und Datenstrukturen; Verstehen; algorithm design and optimization; artificial intelligence; computational geometry; computer graphics; data structures; graph algorithms; graph g; graph theory; graphic methods; models of computation; planar graph; quantum computation; vertex set; algorithm analysis and problem complexity; C; Algorithm Analysis and Problem Complexity; Computer Graphics; Discrete Mathematics in Computer Science; Artificial Intelligence; Data Structures; Computer Communication Networks; Algorithms; Computer Graphics; Discrete Mathematics in Computer Science; Artificial Intelligence; Data Science; Computer Communication Networks; Computer Science; Grafikprogrammierung; Mathematik für Informatiker; Diskrete Mathematik; Künstliche Intelligenz; Datenbanken; Netzwerk-Hardware; BC

The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.

Invited papers.- Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps.- Some Observations on Dynamic Random Walks and Network Renormalization.- Highly Succinct Dynamic Data Structures.- Formal methods.- Largest Common Prefix of a Regular Tree Language.- Winning Strategies for Streaming Rewriting Games.- Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting.- Two characterizations of finite-state dimension.- Complexity.- Optimal channel utilization with limited feedback.- Deterministic Preparation of Dicke States.- Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle.- On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.- Algorithms.- An Efficient Algorithm for the Fast Delivery Problem.- Extension of some edge graph problems: standard and parameterized complexity.- Space Efficient Algorithms for Breadth-Depth Search.- Circular Pattern Matching with k Mismatches.- Succinct Representations of Finite Groups.- On the Tractability of Covering a Graph with 2-Clubs.- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.- Maximum rectilinear convex subsets.- Computing Digraph Width Measures on Directed Co-Graphs.- Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel.- Rare Siblings Speed-up Deterministic Detection and Counting of Small Pattern Graphs.- Bivariate B-splines from convex pseudo-circle configurations.- The Fault-Tolerant Metric Dimension of Cographs.



< zum Archiv...