<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>05211nam a22006135i 4500</leader>
  <controlfield tag="001">978-3-540-74510-5</controlfield>
  <controlfield tag="003">DE-He213</controlfield>
  <controlfield tag="005">20210624224213.0</controlfield>
  <controlfield tag="007">cr nn 008mamaa</controlfield>
  <controlfield tag="008">100301s2007    gw |    s    |||| 0|eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">9783540745105</subfield>
   <subfield code="9">978-3-540-74510-5</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
   <subfield code="a">10.1007/978-3-540-74510-5</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
   <subfield code="a">QA75.5-76.95</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
   <subfield code="a">QA76.63</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
   <subfield code="a">UY</subfield>
   <subfield code="2">bicssc</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
   <subfield code="a">COM014000</subfield>
   <subfield code="2">bisacsh</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
   <subfield code="a">UY</subfield>
   <subfield code="2">thema</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
   <subfield code="a">UYA</subfield>
   <subfield code="2">thema</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="4">
   <subfield code="a">004.0151</subfield>
   <subfield code="2">23</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Computer Science - Theory and Applications</subfield>
   <subfield code="h">[electronic resource] :</subfield>
   <subfield code="b">Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings /</subfield>
   <subfield code="c">edited by Volker Diekert, Mikhail Volkov, Andrei Voronkov.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
   <subfield code="a">1st ed. 2007.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="a">Berlin, Heidelberg :</subfield>
   <subfield code="b">Springer Berlin Heidelberg :</subfield>
   <subfield code="b">Imprint: Springer,</subfield>
   <subfield code="c">2007.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">XIII, 420 p.</subfield>
   <subfield code="b">online resource.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
   <subfield code="a">text</subfield>
   <subfield code="b">txt</subfield>
   <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
   <subfield code="a">computer</subfield>
   <subfield code="b">c</subfield>
   <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
   <subfield code="a">online resource</subfield>
   <subfield code="b">cr</subfield>
   <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
   <subfield code="a">text file</subfield>
   <subfield code="b">PDF</subfield>
   <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
   <subfield code="a">Theoretical Computer Science and General Issues ;</subfield>
   <subfield code="v">4649</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
   <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computers.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Artificial intelligence.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer science—Mathematics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Bioinformatics.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="4">
   <subfield code="a">Theory of Computation.</subfield>
   <subfield code="0">https://scigraph.springernature.com/ontologies/product-market-codes/I16005</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
   <subfield code="a">Algorithm Analysis and Problem Complexity.</subfield>
   <subfield code="0">https://scigraph.springernature.com/ontologies/product-market-codes/I16021</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
   <subfield code="a">Computation by Abstract Devices.</subfield>
   <subfield code="0">https://scigraph.springernature.com/ontologies/product-market-codes/I16013</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
   <subfield code="a">Artificial Intelligence.</subfield>
   <subfield code="0">https://scigraph.springernature.com/ontologies/product-market-codes/I21000</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
   <subfield code="a">Mathematics of Computing.</subfield>
   <subfield code="0">https://scigraph.springernature.com/ontologies/product-market-codes/I17001</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
   <subfield code="a">Bioinformatics.</subfield>
   <subfield code="0">https://scigraph.springernature.com/ontologies/product-market-codes/L15001</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Diekert, Volker.</subfield>
   <subfield code="e">editor.</subfield>
   <subfield code="4">edt</subfield>
   <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Volkov, Mikhail.</subfield>
   <subfield code="e">editor.</subfield>
   <subfield code="4">edt</subfield>
   <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Voronkov, Andrei.</subfield>
   <subfield code="e">editor.</subfield>
   <subfield code="4">edt</subfield>
   <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
   <subfield code="a">SpringerLink (Online service)</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Springer Nature eBook</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
   <subfield code="i">Printed edition:</subfield>
   <subfield code="z">9783540842972</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
   <subfield code="i">Printed edition:</subfield>
   <subfield code="z">9783540745099</subfield>
  </datafield>
  <datafield tag="830" ind1=" " ind2="0">
   <subfield code="a">Theoretical Computer Science and General Issues ;</subfield>
   <subfield code="v">4649</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/978-3-540-74510-5</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
   <subfield code="a">ZDB-2-SCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
   <subfield code="a">ZDB-2-SXCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
   <subfield code="a">ZDB-2-LNC</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="a">Computer Science (SpringerNature-11645)</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="a">Computer Science (R0) (SpringerNature-43710)</subfield>
  </datafield>
 </record>
</collection>
