Fundamentals of Computation Theory 23rd International Symposium, FCT 2021, Athens, Greece, September 12¿15, 2021, Proceedings - neues Buch
2021, ISBN: 3030865924
1st ed. 2021 Kartoniert / Broschiert Informationstheorie, Algorithmen und Datenstrukturen, Theoretische Informatik, Bildverarbeitung, AdaptiveAlgorithms; ArtificialIntelligence; automat… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Fundamentals of Computation Theory 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings - neues Buch
2021, ISBN: 3030865924
1st ed. 2021 Kartoniert / Broschiert Algorithmen und Datenstrukturen, Theoretische Informatik, Maschinelles Sehen, Bildverstehen, AdaptiveAlgorithms; ArtificialIntelligence; automatathe… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
2021, ISBN: 9783030865924
Taschenbuch
Springer, Taschenbuch, Auflage: 1st ed. 2021, 496 Seiten, Publiziert: 2021-09-12T00:00:01Z, Produktgruppe: Buch, 1.54 kg, Informatik, IT-Ausbildung & -Berufe, Computer & Internet, Kategor… Mehr…
amazon.de |
2021, ISBN: 9783030865924
23rd International Symposium, FCT 2021, Athens, Greece, September 12?15, 2021, Proceedings, Buch, Softcover, 1st ed. 2021, [PU: Springer International Publishing], Springer International … Mehr…
lehmanns.de Versandkosten:Versand in 15-20 Tagen. (EUR 0.00) Details... |
Fundamentals of Computation Theory 23rd International Symposium, FCT 2021, Athens, Greece, September 12¿15, 2021, Proceedings - neues Buch
2021, ISBN: 3030865924
1st ed. 2021 Kartoniert / Broschiert Informationstheorie, Algorithmen und Datenstrukturen, Theoretische Informatik, Bildverarbeitung, AdaptiveAlgorithms; ArtificialIntelligence; automat… Mehr…
Pagourtzis, Aris (Herausgeber); Bampis, Evripidis (Herausgeber):
Fundamentals of Computation Theory 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings - neues Buch2021, ISBN: 3030865924
1st ed. 2021 Kartoniert / Broschiert Algorithmen und Datenstrukturen, Theoretische Informatik, Maschinelles Sehen, Bildverstehen, AdaptiveAlgorithms; ArtificialIntelligence; automatathe… Mehr…
2021
ISBN: 9783030865924
Taschenbuch
Springer, Taschenbuch, Auflage: 1st ed. 2021, 496 Seiten, Publiziert: 2021-09-12T00:00:01Z, Produktgruppe: Buch, 1.54 kg, Informatik, IT-Ausbildung & -Berufe, Computer & Internet, Kategor… Mehr…
2021, ISBN: 9783030865924
23rd International Symposium, FCT 2021, Athens, Greece, September 12?15, 2021, Proceedings, Buch, Softcover, 1st ed. 2021, [PU: Springer International Publishing], Springer International … Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Fundamentals of Computation Theory
EAN (ISBN-13): 9783030865924
ISBN (ISBN-10): 3030865924
Taschenbuch
Erscheinungsjahr: 2021
Herausgeber: Springer International Publishing
Buch in der Datenbank seit 2022-02-18T09:41:39+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-02-21T19:02:00+01:00 (Berlin)
ISBN/EAN: 9783030865924
ISBN - alternative Schreibweisen:
3-030-86592-4, 978-3-030-86592-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: fundamentals, 2021
Daten vom Verlag:
Autor/in: Evripidis Bampis; Aris Pagourtzis
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings
Verlag: Springer; Springer International Publishing
476 Seiten
Erscheinungsjahr: 2021-09-12
Cham; CH
Gedruckt / Hergestellt in Niederlande.
Sprache: Englisch
96,29 € (DE)
98,99 € (AT)
106,50 CHF (CH)
POD
XIX, 476 p. 74 illus., 24 illus. in color.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; adaptive algorithms; artificial intelligence; automata theory; computer systems; directed graphs; fuzzy sets; Algorithm design techniques; graph theory; graphic methods; polynomial approximation; signal processing; theoretical computer science; Models of computation; Tree languages; Complexity classes; Problems, reductions and completeness; Computational geometry; Graph algorithms analysis; Approximation algorithms analysis; Fixed parameter tractability; Design and Analysis of Algorithms; Data Structures and Information Theory; Mathematics of Computing; Computer Imaging, Vision, Pattern Recognition and Graphics; Algorithmen und Datenstrukturen; Informationstheorie; Mathematik für Informatiker; Bildverarbeitung; EA
This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
First-Order logic and its Infinitary Quantifier Extensions over Countable Words.- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization.- A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider.- Computational Complexity of Covering Disconnected Multigraphs.- The Complexity of Bicriteria Tree-depth.- TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs.- Bipartite 3-Regular Counting Problems with Mixed Signs.- The Satisfiability Problem for a Quantitative Fragment of PCTL.- Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.- Regular Model Checking with Regular Relations.- Minimum Consistent Subset of Trees.- Parameterized Complexity of Finding Subgraphs with Hereditary Properties onHereditary Graph Classes.- The Space Complexity of Sum Labelling.- On Minimizing Regular Expressions Without Kleene Star.- Computational Complexity of Computing a Quasi-Proper Equilibrium.- Computational Complexity of Synchronization under Sparse Regular Constraints.- On Dasgupta’s hierarchical clustering objective and its relation to other graph parameter.- Mengerian Temporal Graphs Revisited.- Faster FPT Algorithms for Deletion to Pairs of Graph Classes.- Fast Algorithms for the Rooted Triplet Distance Between Caterpillars.- Deciding Top-Down Determinism of Regular Tree Languages.- Propositional Gossip Protocols.- Complexity of word problems for HNN-extensions.- On Finding Separators in Temporal Split and Permutation Graphs.- The Possible Winner Problem with Uncertain Weights Revisited.- Streaming Deletion Problems Parameterized by Vertex Cover.- On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits.- Concentration of Collision Estimator.- Valency-based Consensus under Message Adversaries without Limit-Closure.
Invited papers.- Contributed papers.-
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783031435867 Fundamentals of Computation Theory (Henning Fernau; Klaus Jansen)
- 9783031435867 Fundamentals of Computation Theory (Henning Fernau; Klaus Jansen)
- 9783030250263 Fundamentals of Computation Theory (Leszek Antoni G?sieniec; Jesper Jansson; Christos Levcopoulos)
- 9783030250270 Fundamentals of Computation Theory (Leszek Antoni Gasieniec; Jesper Jansson; Christos Levcopoulos)
- 9783662391617 Fundamentals of Computation Theory (Marek Karpinski)
- 9780387187402 Fundamentals of Computation Theory (Lecture Notes in Computer Science) (Contributor-Lothar Budach)
< zum Archiv...