menu
{ "item_title" : "Mathematical Foundations of Computer Science 2013", "item_author" : [" Krishnendu Chatterjee", "Jirí Sgall "], "item_description" : "Alternation Trading Proofs and Their Limitations.- Bin Packing Games with Selfish Items.- A Constructive Proof of the Topological Kruskal Theorem.- Prior-Free Auctions of Digital Goods.- Clustering on k-Edge-Colored Graphs.- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally.- Rewriting Guarded Negation Queries.- Parity Games and Propositional Proofs.- Bringing Order to Special Cases of Klee's Measure Problem.- Learning Reductions to Sparse Sets.- Probabilistic Automata with Isolated Cut-Points.- On Stochastic Games with Multiple Objectives.- Paradigms for Parameterized Enumeration.- Noninterference with Local Policies.- Ordering Metro Lines by Block Crossings.- Meta-kernelization with Structural Parameters.- Polynomial Threshold Functions and Boolean Threshold Circuits.- Detecting Regularities on Grammar-Compressed Strings.- An Unusual Temporal Logic.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/64/240/312/3642403123_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" : "" } }
Mathematical Foundations of Computer Science 2013|Krishnendu Chatterjee

Mathematical Foundations of Computer Science 2013 : 38th International Symposium, Mfcs 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings

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

Overview

Alternation Trading Proofs and Their Limitations.- Bin Packing Games with Selfish Items.- A Constructive Proof of the Topological Kruskal Theorem.- Prior-Free Auctions of Digital Goods.- Clustering on k-Edge-Colored Graphs.- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally.- Rewriting Guarded Negation Queries.- Parity Games and Propositional Proofs.- Bringing Order to Special Cases of Klee's Measure Problem.- Learning Reductions to Sparse Sets.- Probabilistic Automata with Isolated Cut-Points.- On Stochastic Games with Multiple Objectives.- Paradigms for Parameterized Enumeration.- Noninterference with Local Policies.- Ordering Metro Lines by Block Crossings.- Meta-kernelization with Structural Parameters.- Polynomial Threshold Functions and Boolean Threshold Circuits.- Detecting Regularities on Grammar-Compressed Strings.- An Unusual Temporal Logic.

This item is Non-Returnable

Details

  • ISBN-13: 9783642403125
  • ISBN-10: 3642403123
  • Publisher: Springer
  • Publish Date: August 2013
  • Dimensions: 9.21 x 6.14 x 1.72 inches
  • Shipping Weight: 2.63 pounds
  • Page Count: 854

Related Categories

You May Also Like...

    1

BAM Customer Reviews