- 5 Ergebnisse
Kleinster Preis: € 104,74, größter Preis: € 139,22, Mittelwert: € 120,25
1
Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings - Andrzej Szepietowski
Bestellen
bei ZVAB.com
€ 104,74
Versand: € 0,001
Bestellengesponserter Link
Andrzej Szepietowski:

Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings - Taschenbuch

2005, ISBN: 3540287027

[EAN: 9783540287025], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], INFORMATIK; ALGORITHMICGEOMETRY; ALGORITHMICS; ALGORITHMS; APPROXIMATIONALGORITHMS; AUTOMATA; CALCULUS; CIRCUIT… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Mathematical Foundations of Computer Science 2005 - Andrzej Szepietowski
Bestellen
bei AbeBooks.de
€ 139,09
Versand: € 0,001
Bestellengesponserter Link

Andrzej Szepietowski:

Mathematical Foundations of Computer Science 2005 - Taschenbuch

2005, ISBN: 3540287027

[EAN: 9783540287025], Neubuch, [PU: Springer Berlin Heidelberg Aug 2005], INFORMATIK; ALGORITHMICGEOMETRY; ALGORITHMICS; ALGORITHMS; APPROXIMATIONALGORITHMS; AUTOMATA; CALCULUS; CIRCUITTH… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
3
Mathematical Foundations of Computer Science 2005 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings - Szepietowski, Andrzej (Herausgeber); Jedrzejowicz, Joanna (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 111,22
Versand: € 0,001
Bestellengesponserter Link
Szepietowski, Andrzej (Herausgeber); Jedrzejowicz, Joanna (Herausgeber):
Mathematical Foundations of Computer Science 2005 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings - neues Buch

2005

ISBN: 3540287027

2005 Kartoniert / Broschiert Informatik, Diskrete Mathematik, Algorithmen und Datenstrukturen, Datenbanken, Theoretische Informatik, algorithmicgeometry; algorithmics; algorithms; appro… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
4
Bestellen
bei Biblio.co.uk
$ 156,22
(ca. € 139,22)
Versand: € 11,921
Bestellengesponserter Link
Joanna Jerdzejowicz:
Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings - Taschenbuch

2005, ISBN: 9783540287025

Paperback / softback. New. Constitutes the proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/Se… Mehr…

Versandkosten: EUR 11.92 The Saint Bookstore
5
Mathematical Foundations of Computer Science 2005 - Joanna Jedrzejowicz; Andrzej Szepietowski
Bestellen
bei lehmanns.de
€ 106,99
Versand: € 0,001
Bestellengesponserter Link
Joanna Jedrzejowicz; Andrzej Szepietowski:
Mathematical Foundations of Computer Science 2005 - Erstausgabe

2005, ISBN: 9783540287025

Taschenbuch

30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings, Buch, Softcover, [PU: Springer Berlin], [ED: 1], Springer Berlin, 2005

Versandkosten:Versand in 10-14 Tagen. (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
Mathematical Foundations of Computer Science 2005

This book constitutes the refereed proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005. The 62 revised full papers presented together with full papers or abstracts of 7 invited talks were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from quantum computing, approximation, automata, circuits, scheduling, games, languages, discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.

Detailangaben zum Buch - Mathematical Foundations of Computer Science 2005


EAN (ISBN-13): 9783540287025
ISBN (ISBN-10): 3540287027
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin

Buch in der Datenbank seit 2007-06-05T07:54:19+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-12-12T12:32:24+01:00 (Vienna)
ISBN/EAN: 9783540287025

ISBN - alternative Schreibweisen:
3-540-28702-7, 978-3-540-28702-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: andrzej just
Titel des Buches: mfc, gdansk, mathematical foundations computer science, the mathematical foundations, ufo symposium, mfcs, 2005, september


Daten vom Verlag:

Autor/in: Joanna Jedrzejowicz; Andrzej Szepietowski
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Mathematical Foundations of Computer Science 2005 - 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings
Verlag: Springer; Springer Berlin
814 Seiten
Erscheinungsjahr: 2005-08-17
Berlin; Heidelberg; DE
Gewicht: 1,258 kg
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XVI, 814 p.

BC; Theory of Computation; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; algorithmic geometry; algorithmics; algorithms; approximation algorithms; automata; calculus; circuit theory; combinatorial optimization; complexity; databases; formal languages; graph algorithms; graph computations; logic; theore; algorithm analysis and problem complexity; data structures; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Discrete Mathematics in Computer Science; Data Structures; Logics and Meanings of Programs; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Data Science; Computer Science Logic and Foundations of Programming; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA

Invited Lectures.- Page Migration in Dynamic Networks.- Knot Theory, Jones Polynomial and Quantum Computing.- Interactive Algorithms 2005.- Some Computational Issues in Membrane Computing.- The Generalization of Dirac’s Theorem for Hypergraphs.- On the Communication Complexity of Co-linearity Problems.- An Invitation to Play.- Papers.- The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem.- On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions.- Pure Nash Equilibria in Games with a Large Number of Actions.- On the Complexity of Depth-2 Circuits with Threshold Gates.- Isomorphic Implication.- Abstract Numeration Systems and Tilings.- Adversarial Queueing Model for Continuous Network Dynamics.- Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time.- Regular Sets of Higher-Order Pushdown Stacks.- Linearly Bounded Infinite Graphs.- Basic Properties for Sand Automata.- A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs.- Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.- New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling.- Approximating Polygonal Objects by Deformable Smooth Surfaces.- Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications.- Asynchronous Deterministic Rendezvous in Graphs.- Zeta-Dimension.- Online Interval Coloring with Packing Constraints.- Separating the Notions of Self- and Autoreducibility.- Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.- Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.- Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.- Packing Weighted Rectangles into a Square.- Nondeterministic Graph Searching: From Pathwidth to Treewidth.- Goals in the Propositional Horn??? Language Are Monotone Boolean Circuits.- Autoreducibility, Mitoticity, and Immunity.- Canonical Disjoint NP-Pairs of Propositional Proof Systems.- Complexity of DNF and Isomorphism of Monotone Formulas.- The Expressive Power of Two-Variable Least Fixed-Point Logics.- Languages Representable by Vertex-Labeled Graphs.- On the Complexity of Mixed Discriminants and Related Problems.- Two Logical Hierarchies of Optimization Problems over the Real Numbers.- Algebras as Knowledge Structures.- Combining Self-reducibility and Partial Information Algorithms.- Complexity Bounds for Regular Games.- Basic Mereology with Equivalence Relations.- Online and Dynamic Recognition of Squarefree Strings.- Shrinking Restarting Automata.- Removing Bidirectionality from Nondeterministic Finite Automata.- Generating All Minimal Integral Solutions to Monotone ?,?-Systems of Linear, Transversal and Polymatroid Inequalities.- On the Parameterized Complexity of Exact Satisfiability Problems.- Approximating Reversal Distance for Strings with Bounded Number of Duplicates.- Random Databases and Threshold for Monotone Non-recursive Datalog.- An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.- Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.- Tight Approximability Results for the Maximum Solution Equation Problem over Z p .- The Complexity of Model Checking Higher Order Fixpoint Logic.- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules.- Inverse Monoids: Decidability and Complexity of Algebraic Questions.- Dimension Is Compression.- Concurrent Automata vs. Asynchronous Systems.- Completeness and Degeneracy in Information Dynamics of Cellular Automata.- Strict Language Inequalities and Their Decision Problems.- Event Structures for the Collective Tokens Philosophy of Inhibitor Nets.- An Exact 2.9416 n Algorithm for the Three Domatic Number Problem.- D-Width: A More Natural Measure for Directed Tree Width.- On Beta-Shifts Having Arithmetical Languages.- A BDD-Representation for the Logic of Equality and Uninterpreted Functions.- On Small Hard Leaf Languages.- Explicit Inapproximability Bounds for the Shortest Superstring Problem.- Stratified Boolean Grammars.

< zum Archiv...