000 04349nam a22007095i 4500
001 978-3-030-97099-4
003 DE-He213
005 20240730180026.0
007 cr nn 008mamaa
008 220302s2022 sz | s |||| 0|eng d
020 _a9783030970994
_9978-3-030-97099-4
024 7 _a10.1007/978-3-030-97099-4
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFrontiers of Algorithmics
_h[electronic resource] :
_bInternational Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16-19, 2021, Proceedings /
_cedited by Jing Chen, Minming Li, Guochuan Zhang.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXXV, 79 p. 9 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12874
505 0 _aInsights 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.
520 _aThis book constitutes the proceedings of the 15th International Workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with second International Joint Conference on Theoretical Computer Science (IJTCS 2021), as IJTCS-FAW 2021, in Beijing, China, in August 2021. The conference IJTCS-FAW 2021 was held in hybrid mode due to the COVID-19 pandemic. The 5 full papers presented in this volume were carefully reviewed and selected from 9 submissions. The joint conference provides a focused forum on Algorithmic Game Theory, Blockchain, Multi-agent Reinforcement Learning, Quantum Computation, Theory of Machine Learning, Machine Learning, Formal Method, Algorithm and Complexity, and EconCS.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer Engineering and Networks.
_9118651
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aDesign and Analysis of Algorithms.
_931835
700 1 _aChen, Jing.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9118652
700 1 _aLi, Minming.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9118653
700 1 _aZhang, Guochuan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9118654
710 2 _aSpringerLink (Online service)
_9118655
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030970987
776 0 8 _iPrinted edition:
_z9783030971007
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12874
_9118656
856 4 0 _uhttps://doi.org/10.1007/978-3-030-97099-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90143
_d90143