Cantitate/Preț
Produs
Total produse
Vezi coșul
Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings de Petr Hliněný

Mathematical Foundations of Computer Science 2010: 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6281

Editat de Petr Hliněný, Antonin Kucera
en Limba Engleză Paperback – 10 aug 2010

Editorii Petr Hliněný și Antonin Kucera coordonează acest volum dens, care marchează a 35-a etapă a unei tradiții începute în 1972 în spațiul Europei Centrale. Observăm în acest tom o rigoare academică deosebită, selecția finală reprezentând mai puțin de 40% din propunerile înscrise, ceea ce garantează un conținut axat pe inovație și validitate matematică. Descoperim aici o sinergie între informatica teoretică și logica computațională, volumul fiind rezultatul unei conferințe federate cu CSL 2010.

Structura lucrării este organizată pentru a ghida cercetătorul prin cele mai recente frontiere ale domeniului. Progresia pornește de la fundamentele algoritmilor cuantici și omologia persistentă sub erori non-uniforme, avansând spre probleme complexe de scheduling în timp real și complexitatea spațiului exponențial. Un element distinctiv al acestui volum este includerea prelegerilor invitate susținute de experți precum Andris Ambainis sau Juraj Hromkovic, care oferă o privire de ansamblu asupra problemelor de online computing și a noilor dezvoltări în teoria grafurilor. Ca și alți contributori din seria Lecture Notes in Computer Science, autorii distilează experiență reală în principii acționabile, transformând demonstrațiile teoretice în baze pentru dezvoltarea software viitoare. Putem afirma că volumul reușește să aducă împreună ramuri care rareori se intersectează la conferințe specializate, oferind o perspectivă unificată asupra fundamentelor matematice ale calculului modern.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 64320 lei

Preț vechi: 80400 lei
-20%

Puncte Express: 965

Carte disponibilă

Livrare economică 18 mai-01 iunie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783642151545
ISBN-10: 364215154X
Pagini: 731
Ilustrații: XVII, 714 p. 71 illus.
Dimensiuni: 11 x 93 x 33 mm
Greutate: 1.07 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

De ce să citești această carte

Recomandăm această lucrare cercetătorilor și studenților la doctorat care doresc să stăpânească fundamentele matematice avansate ale informaticii. Cititorul câștigă acces la studii de caz riguroase despre algoritmi de tăiere în grafuri planare, sisteme de demonstrație și complexitate, fiind un instrument esențial pentru cei care lucrează la granița dintre matematică și dezvoltarea de sisteme computaționale complexe.

Cuprins

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 inGame 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 IndependentStrings.- Impossibility of Independence Amplification in Kolmogorov Complexity Theory.

Descriere

The series of MFCS symposia, organized in rotation by Poland, Slovakia, and the Czech Republic since 1972, has a long and well-established tradition. The symposiaencouragehigh-qualityresearchinallbranchesoftheoreticalcomputer science.Their broadscopeprovidesanopportunityto bring together researchers whodonotusuallymeetatspecialized conferences. The 35th International Symposium on Mathematical Foundations of C- puter Science (MFCS 2010) was organized in parallel with the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010). The federated MFCS and CSL 2010 conference had shared plenary sessions and social events forallparticipants, butthescienti?cprogramandtheproceedingswereprepared independently for both events. Out of 149 regular submissions to MFCS 2010, the Program Committee - lected 56 papers for presentation at the conference and publication in this v- ume. Each paper was reviewed by at least three Program Committee members with the help of outside experts, and the actual selection was based on a sub- quent electronic discussion. In addition to the contributed papers, the scienti?c program of MFCS 2010 included ?ve MFCS and CSL plenary talks delivered by David Basin (ETH Z] urich), HerbertEdelsbrunner (IST Austria andDuke University), ErichGrad ] el (RWTH Aachen), Bojan Mohar (University of Ljubljana and Simon Fraser U- versity), andJosephSifakis (CNRS), andthree invitedMFCS lecturesby Andris Ambainis (University of Latvia), Juraj Hromkovi?c(ETHZur ] ich), and Daniel Lokshtanov (Universitetet i Bergen). We are grateful to the invited speakers for accepting our invitation and sharing their knowledge and skills with all MFCS 2010 participants.