menu
{ "item_title" : "Theory and Applications of Models of Computation", "item_author" : [" T. V. Gopal", "Manindra Agrawal", "Angsheng Li "], "item_description" : "A 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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/906/088/3319060880_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Theory and Applications of Models of Computation|T. V. Gopal

Theory and Applications of Models of Computation : 11th Annual Conference, Tamc 2014, Chennai, India, April 11-13, 2014, Proceedings

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

A 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.

This item is Non-Returnable

Details

  • ISBN-13: 9783319060880
  • ISBN-10: 3319060880
  • Publisher: Springer
  • Publish Date: April 2014
  • Dimensions: 9.21 x 6.14 x 0.89 inches
  • Shipping Weight: 1.35 pounds
  • Page Count: 423

Related Categories

You May Also Like...

    1

BAM Customer Reviews