- 0 Ergebnisse
Kleinster Preis: € 24,67, größter Preis: € 127,90, Mittelwert: € 69,51
1
Mathematical Foundations of Computer Science 2010 - Herausgegeben:Hlineny, Petr Kucera, Antonin
Bestellen
bei booklooker.de
€ 34,99
Versand: € 0,001
Bestellengesponserter Link
Herausgegeben:Hlineny, Petr Kucera, Antonin:

Mathematical Foundations of Computer Science 2010 - Erstausgabe

2010, ISBN: 9783642151545

Taschenbuch

[ED: Softcover], [PU: Springer / Springer Berlin Heidelberg / Springer, Berlin], The series of MFCS symposia, organized in rotation by Poland, Slovakia, and the Czech Republic since 1972,… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) buecher.de GmbH & Co. KG
2
Mathematical Foundations of Computer Science 2010 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings - Hlineny, Petr (Herausgeber); Kucera, Antonin (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 127,90
Versand: € 0,001
Bestellengesponserter Link

Hlineny, Petr (Herausgeber); Kucera, Antonin (Herausgeber):

Mathematical Foundations of Computer Science 2010 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings - neues Buch

2010, ISBN: 364215154X

Kartoniert / Broschiert EDV / Theorie / Informatik / Mathematik, Informatik, Diskret (mathematisch), Mathematik, Algorithmus, Compiler, Übersetzer (EDV), Programmiersprachen, Mathematik … Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
3
Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings (Lecture Notes in Computer Science, 6281, Band 6281)
Bestellen
bei amazon.de
€ 24,67
Versand: € 3,001
Bestellengesponserter Link
Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings (Lecture Notes in Computer Science, 6281, Band 6281) - Taschenbuch

2010

ISBN: 9783642151545

Springer, Taschenbuch, Auflage: 2010, 731 Seiten, Publiziert: 2010-08-10T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: Illustrations, 2.27 kg, Informatik, IT-Ausbildung & -Berufe, Compu… Mehr…

Versandkosten:Auf Lager. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) ausverkauf
4
Mathematical Foundations of Computer Science 2010 - Hlineny, Petr Kucera, Antonin
Bestellen
bei booklooker.de
€ 36,95
Versand: € 0,001
Bestellengesponserter Link
Hlineny, Petr Kucera, Antonin:
Mathematical Foundations of Computer Science 2010 - Erstausgabe

2010, ISBN: 9783642151545

Taschenbuch

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], New Developments in Quantum Algorithms.- Persistent Homology under Non-uniform Error.- Information Complexity of Online Pr… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
5
Mathematical Foundations of Computer Science 2010 - Petr Hlineny; Antonin Kucera
Bestellen
bei lehmanns.de
€ 123,04
Versand: € 0,001
Bestellengesponserter Link
Petr Hlineny; Antonin Kucera:
Mathematical Foundations of Computer Science 2010 - Taschenbuch

2010, ISBN: 9783642151545

35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2010

Versandkosten:sofort lieferbar. (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.
Details zum Buch
Mathematical Foundations of Computer Science 2010

This volume constitutes the refereed proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, held in Brno, Czech Republic, in August 2010. The 56 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 149 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.

Detailangaben zum Buch - Mathematical Foundations of Computer Science 2010


EAN (ISBN-13): 9783642151545
ISBN (ISBN-10): 364215154X
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin
714 Seiten
Gewicht: 1,028 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2009-11-20T00:57:54+01:00 (Vienna)
Detailseite zuletzt geändert am 2022-06-19T11:56:23+02:00 (Vienna)
ISBN/EAN: 9783642151545

ISBN - alternative Schreibweisen:
3-642-15154-X, 978-3-642-15154-5


Daten vom Verlag:

Autor/in: Petr Hlineny; Antonin Kucera
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Mathematical Foundations of Computer Science 2010 - 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings
Verlag: Springer; Springer Berlin
714 Seiten
Erscheinungsjahr: 2010-08-10
Berlin; Heidelberg; DE
Gewicht: 1,088 kg
Sprache: Englisch
123,04 € (DE)
126,49 € (AT)
153,65 CHF (CH)
POD
XVII, 714 p. 71 illus.

BC; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; algorithmic game theory; algorithms; artificial intelligence; complexity; computational geometry; data structures; databases; logic; algorithm analysis and problem complexity; C; Programming Techniques; Programming Languages, Compilers, Interpreters; Theory of Computation; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computation by Abstract Devices; Programming Techniques; Compilers and Interpreters; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Computer Science; Compiler und Übersetzer; Theoretische Informatik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; EA

New Developments in Quantum Algorithms.- Persistent Homology under Non-uniform Error.- Information Complexity of Online Problems.- Algorithmic Lower Bounds for Problems on Decomposable Graphs.- Do We Really Understand the Crossing Numbers?.- Balanced Queries: Divide and Conquer.- Slowly Synchronizing Automata and Digraphs.- Weights of Exact Threshold Functions.- Proof Systems and Transformation Games.- Scheduling Real-Time Mixed-Criticality Jobs.- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption.- On Problem Kernels for Possible Winner Determination under the k-Approval Protocol.- Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time.- Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.- Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.- Distance Constraint Satisfaction Problems.- Faster Algorithms on Branch and Clique Decompositions.- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.- Robust Computations with Dynamical Systems.- On Factor Universality in Symbolic Spaces.- Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity.- Resource Combinatory Algebras.- Randomness for Free.- Qualitative Analysis of Partially-Observable Markov Decision Processes.- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model.- Online Clustering with Variable Sized Clusters.- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.- Counting Classes and the Fine Structure between NC 1 and L.- The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn).- Connected Searching of Weighted Trees.- Iterated Regret Minimization in Game Graphs.- Properties of Visibly Pushdown Transducers.- Second-Order Algebraic Theories.- Frame Definability for Classes of Trees in the ?-calculus.- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model.- Finding and Counting Vertex-Colored Subtrees.- Limiting Negations in Bounded Treewidth and Upward Planar Circuits.- On the Topological Complexity of MSO+U and Related Automata Models.- Least and Greatest Solutions of Equations over Sets of Integers.- Improved Simulation of Nondeterministic Turing Machines.- The Prize-Collecting Edge Dominating Set Problem in Trees.- The Multivariate Resultant Is NP-hard in Any Characteristic.- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems.- Meta-Envy-Free Cake-Cutting Protocols.- Two Variables and Two Successors.- Harnessing ML F with the Power of System F.- Describing Average- and Longtime-Behavior by Weighted MSO Logics.- Solving minones-2-sat as Fast as vertex cover.- Unambiguous Finite Automata over a Unary Alphabet.- The Complexity of Finding Reset Words in Finite Automata.- Does Treewidth Help in Modal Satisfiability?.- Asynchronous Omega-Regular Games with Partial Information.- Parity Games with Partial Information Played on Graphs of Bounded Complexity.- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.- Enumeration of the Monomials of a Polynomial and Related Complexity Classes.- Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs.- Semi-linear Parikh Images of Regular Expressions via Reduction.- Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds.- Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences.- Counting Dependent and Independent Strings.- Impossibility of Independence Amplification in Kolmogorov Complexity Theory.

< zum Archiv...