Computer Science – Theory and Applications (Record no. 37061)

000 -LEADER
fixed length control field 04546nam a22005895i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540745105
-- 978-3-540-74510-5
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
245 10 - TITLE STATEMENT
Title Computer Science – Theory and Applications
Sub Title Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007. Proceedings /
Statement of responsibility, etc edited by Volker Diekert, Mikhail V. Volkov, Andrei Voronkov.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2007.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XIII, 420 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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 Lower Bounds -- 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Information theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Electronic data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Bioinformatics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computing Methodologies.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Bioinformatics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Diekert, Volker.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Volkov, Mikhail V.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Voronkov, Andrei.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-540-74510-5
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2007.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK7767 http://dx.doi.org/10.1007/978-3-540-74510-5 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha