MARC Record from harvard_bibliographic_metadata

LEADER: 03720nam a22005655a 4500
001 014020870-4
005 20140620185758.0
008 140401s2014 gw | s ||0| 0|eng d
020 $a9783319060897
020 $a9783319060897
020 $a9783319060880
024 7 $a10.1007/978-3-319-06089-7$2doi
035 $a(Springer)9783319060897
040 $aSpringer
050 4 $aQA75.5-76.95
072 7 $aUY$2bicssc
072 7 $aUYA$2bicssc
072 7 $aCOM014000$2bisacsh
072 7 $aCOM031000$2bisacsh
082 04 $a004.0151$223
100 1 $aGopal, T. V.,$eeditor.
245 10 $aTheory and Applications of Models of Computation :$b11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings /$cedited by T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper.
264 1 $aCham :$bSpringer International Publishing :$bImprint: Springer,$c2014.
300 $aXIV, 423 p. 75 illus.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v8402
505 0 $aA Roadmap for TAMC -- A tight lower bound instance for k-means++ in constant dimension -- An improved Upper-bound for Rivest et al.’s Half-lie Problem -- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update -- Finite State Incompressible Infinite Sequences -- Finding optimal strategies of almost acyclic Simple Stochastic Games -- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes -- On representations of abstract systems with partial inputs and outputs -- Complexity Information Flow in a Multi-threaded Imperative Language -- An Incremental Algorithm for Computing Prime Implicates in Modal Logic -- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems -- space complexity of optimization problems in planar graphs -- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching -- Intersection Dimension of Bipartite Graphs -- On the Parameterized Complexity for Token Jumping on Graphs -- More on Universality of Spiking Neural P Systems with Anti-Spikes -- Modular Form Approach to Solving Lattice Problems.  .
520 $aThis book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers explore the algorithmic foundations, computational methods, and computing devices to meet today's and tomorrow's challenges of complexity, scalability, and sustainability, with wide-ranging impacts on everything from the design of biological systems to the understanding of economic markets and social networks.
650 10 $aComputer science.
650 0 $aData structures (Computer science)
650 0 $aComputer science.
650 0 $aInformation theory.
650 0 $aComputer software.
650 0 $aLogic design.
650 24 $aTheory of Computation.
650 24 $aMathematics of Computing.
650 24 $aAlgorithm Analysis and Problem Complexity.
650 24 $aLogics and Meanings of Programs.
650 24 $aData Structures, Cryptology and Information Theory.
650 24 $aMathematical Logic and Formal Languages.
700 1 $aCooper, S. Barry,$eeditor.
700 1 $aLi, Angsheng,$eeditor.
700 1 $aAgrawal, Manindra,$eeditor.
776 08 $iPrinted edition:$z9783319060880
830 0 $aLecture Notes in Computer Science ;$v8402.
988 $a20140502
906 $0VEN