| 000 | 04805nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-74510-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240730191546.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2007 gw | s |||| 0|eng d | ||
| 020 |
_a9783540745105 _9978-3-540-74510-5 |
||
| 024 | 7 |
_a10.1007/978-3-540-74510-5 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aComputer Science - Theory and Applications _h[electronic resource] : _bSecond International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings / _cedited by Volker Diekert, Mikhail Volkov, Andrei Voronkov. |
| 250 | _a1st ed. 2007. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
| 300 |
_aXIII, 420 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4649 |
|
| 505 | 0 | _aProving 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. | |
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aArtificial intelligence. _93407 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aBioinformatics. _99561 |
|
| 650 | 1 | 4 |
_aTheory of Computation. _9146480 |
| 650 | 2 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
| 650 | 2 | 4 |
_aMathematics of Computing. _931875 |
| 650 | 2 | 4 |
_aBioinformatics. _99561 |
| 700 | 1 |
_aDiekert, Volker. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146481 |
|
| 700 | 1 |
_aVolkov, Mikhail. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146482 |
|
| 700 | 1 |
_aVoronkov, Andrei. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9146483 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9146484 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540745099 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540842972 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4649 _9146485 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-74510-5 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c93791 _d93791 |
||