Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 57,12
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 76,84
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 438.
Idioma: Inglés
Publicado por Springer-Verlag New York Inc, 2007
ISBN 10: 3540745092 ISBN 13: 9783540745099
Librería: Revaluation Books, Exeter, Reino Unido
EUR 81,22
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 1st edition. 420 pages. 9.20x6.50x1.00 inches. In Stock.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book features the refereed proceedings of the 2nd International Symposium on Computer Science in Russia held in September 2007. The 35 papers cover theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory; and applications of logic to computer science. Many applications are presented.
Librería: preigu, Osnabrück, Alemania
EUR 50,35
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Computer Science - Theory and Applications | Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings | Volker Diekert (u. a.) | Taschenbuch | xiii | Englisch | 2007 | Springer | EAN 9783540745099 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 102,54
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Aug 2007, 2007
ISBN 10: 3540745092 ISBN 13: 9783540745099
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book features the refereed proceedings of the 2nd International Symposium on Computer Science in Russia held in September 2007. The 35 papers cover theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory; and applications of logic to computer science. Many applications are presented. 436 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 79,68
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 438 Illus.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 80,17
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 438.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2007
ISBN 10: 3540745092 ISBN 13: 9783540745099
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents the refereed proceedings of the 2nd International Symposium on Computer Science in RussiaIncludes 37 carefully reviewed full papersAddresses all major areas in computer scienceCovers applications such as programming and lang.
Idioma: Inglés
Publicado por Springer, Springer Aug 2007, 2007
ISBN 10: 3540745092 ISBN 13: 9783540745099
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Proving Church's Thesis.- The Limits of Quantum Computers.- Marrying Words and Trees.- TPTP, TSTP, CASC, etc.- Abstract Modeling and Formal Verification of Microprocessors.- Sequences of Level 1, 2, 3,., k,.- Timers and Proximities for Mobile Ambients.- Pushing Random Walk Beyond Golden Ratio.- Reversible Machine Code and Its Abstract Processor Architecture.- A Fast Algorithm for Path 2-Packing Problem.- Decidability of Parameterized Probabilistic Information Flow.- Inverting Onto Functions and Polynomial Hierarchy.- Proved-Patterns-Based Development for Structured Programs.- Planarity, Determinants, Permanents, and (Unique) Matchings.- Equivalence Problems for Circuits over Sets of Natural Numbers.- Bouillon: A Wiki-Wiki Social Web.- A PDL-Like Logic of Knowledge Acquisition.- Resource Placement in Networks Using Chromatic Sets of Power Graphs.- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.- Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.- New Bounds for MAX-SAT by Clause Learning.- Towards Hierarchical Clustering (Extended Abstract).- Estimation of the Click Volume by Large Scale Regression Analysis.- Maximal Intersection Queries in Randomized Graph Models.- A Note on Specialization of Interpreters.- Efficient Computation in Groups Via Compression.- Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization.- On the Complexity of Matrix Rank and Rigidity.- On the Usage of Clustering for Content Based Image Retrieval.- Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic.- Application of Modified Coloured Petri Nets to Modeling and Verification of SDL Specified Communication Protocols.- Symmetry of Information and Nonuniform LowerBounds.- Perceptrons of Large Weight.- A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes.- Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents.- Generic Complexity of Presburger Arithmetic.- Everywhere -Repetitive Sequences and Sturmian Words.- Timed Traces and Strand Spaces.- On Empirical Meaning of Randomness with Respect to a Real Parameter.- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity.- Generic Complexity of Undecidable Problems.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 436 pp. Englisch.