LEADER 04684nam 22007815 450 001 996203623703316 005 20230220083029.0 010 $a3-319-06089-9 024 7 $a10.1007/978-3-319-06089-7 035 $a(CKB)3710000000106753 035 $a(DE-He213)978-3-319-06089-7 035 $a(SSID)ssj0001205092 035 $a(PQKBManifestationID)11674077 035 $a(PQKBTitleCode)TC0001205092 035 $a(PQKBWorkID)11191961 035 $a(PQKB)11128439 035 $a(MiAaPQ)EBC3093448 035 $a(PPN)178320404 035 $a(EXLCZ)993710000000106753 100 $a20140401d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTheory and Applications of Models of Computation$b[electronic resource] $e11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings /$fedited by T V Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XIV, 423 p. 75 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8402 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-06088-0 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8402 606 $aComputer science 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aMachine theory 606 $aTheory of Computation 606 $aMathematics of Computing 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aData Structures and Information Theory 606 $aFormal Languages and Automata Theory 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aMachine theory. 615 14$aTheory of Computation. 615 24$aMathematics of Computing. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aData Structures and Information Theory. 615 24$aFormal Languages and Automata Theory. 676 $a004.0151 702 $aGopal$b T V$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aAgrawal$b Manindra$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLi$b Angsheng$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCooper$b S. Barry$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996203623703316 996 $aTheory and Applications of Models of Computation$9772738 997 $aUNISA