000 04009nam a22006375i 4500
001 978-3-319-06089-7
003 DE-He213
005 20200421111155.0
007 cr nn 008mamaa
008 140401s2014 gw | s |||| 0|eng d
020 _a9783319060897
_9978-3-319-06089-7
024 7 _a10.1007/978-3-319-06089-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aTheory and Applications of Models of Computation
_h[electronic resource] :
_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 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aMathematics of Computing.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aData Structures, Cryptology and Information Theory.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aGopal, T. V.
_eeditor.
700 1 _aAgrawal, Manindra.
_eeditor.
700 1 _aLi, Angsheng.
_eeditor.
700 1 _aCooper, S. Barry.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319060880
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8402
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-06089-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53495
_d53495