Del i serien Lecture Notes in Computer Science

Computer Science - Theory and Applications

Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings

Häftad, Engelska, 2007

AvVolker Diekert,Mikhail Volkov,Andrei Voronkov

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2007-08-15
Mått155 x 235 x 24 mm
Vikt657 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor420
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540745099

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

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.

Du kanske också är intresserad av

Del 13257

Developments in Language Theory

Volker Diekert, Mikhail Volkov

Häftad, 2022

1 109 kr

Combinatorics on Traces

Volker Diekert

Häftad, 1990

719 kr

Finitely Presented Groups

Volker Diekert, Martin Kreuzer

Inbunden, 2024

2 499 kr

Elements of Discrete Mathematics

Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf

Häftad, 2023

969 kr

Del 13911

Developments in Language Theory

Frank Drewes, Mikhail Volkov

Häftad, 2023

979 kr

Developments in Language Theory

Volker Diekert, Dirk Nowotka

Häftad, 2009

749 kr

Elemente Der Diskreten Mathematik

Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf

Häftad, 2026

1 059 kr

STACS 2004

Volker Diekert, Michel Habib

Häftad, 2004

1 479 kr

Elemente Der Diskreten Mathematik

Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger

Inbunden, 2013

479 kr

Diskrete Algebraische Methoden

Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger

Inbunden, 2013

479 kr

Del i serien Lecture Notes in Computer Science

Computer Science - Theory and Applications

Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings

Häftad, Engelska, 2007

AvVolker Diekert,Mikhail Volkov,Andrei Voronkov

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2007-08-15
Mått155 x 235 x 24 mm
Vikt657 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor420
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540745099

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

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.