menu
{ "item_title" : "Frontiers of Algorithmics", "item_author" : [" Jing Chen", "Minming Li", "Guochuan Zhang "], "item_description" : "Insights from the Conscious Turing Machine (CTM).- Speculative Smart Contracts.- Optimization from Structured Samples-An Effective Approach for Data-Driven Optimization.- Recent Developments in Property Testing of Boolean Functions.- AC0 Circuits, First-Order Logic, and Well-Structured graphs.- Model-Based Digital Engineering and Verification of Intelligent Systems.- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions.- Fast Sampling Constraint Satisfaction Solutions via the Lov sz Local Lemma.- Pool Block Withholding Attack with Rational Miners.- Approximation Algorithms for the Directed Path Partition Problems.- Faster Algorithms for k-Subset Sum and variations.- Hardness and Algorithms for Electoral Manipulation under Media Influence.- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/097/098/3030970981_b.jpg", "price_data" : { "retail_price" : "59.99", "online_price" : "59.99", "our_price" : "59.99", "club_price" : "59.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Frontiers of Algorithmics|Jing Chen

Frontiers of Algorithmics : International Joint Conference, Ijtcs-Faw 2021, Beijing, China, August 16-19, 2021, Proceedings

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

Overview

Insights from the Conscious Turing Machine (CTM).- Speculative Smart Contracts.- Optimization from Structured Samples-An Effective Approach for Data-Driven Optimization.- Recent Developments in Property Testing of Boolean Functions.- AC0 Circuits, First-Order Logic, and Well-Structured graphs.- Model-Based Digital Engineering and Verification of Intelligent Systems.- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions.- Fast Sampling Constraint Satisfaction Solutions via the Lov sz Local Lemma.- Pool Block Withholding Attack with Rational Miners.- Approximation Algorithms for the Directed Path Partition Problems.- Faster Algorithms for k-Subset Sum and variations.- Hardness and Algorithms for Electoral Manipulation under Media Influence.- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing.

This item is Non-Returnable

Details

  • ISBN-13: 9783030970987
  • ISBN-10: 3030970981
  • Publisher: Springer
  • Publish Date: March 2022
  • Dimensions: 9.21 x 6.14 x 0.22 inches
  • Shipping Weight: 0.36 pounds
  • Page Count: 79

Related Categories

You May Also Like...

    1

BAM Customer Reviews