000 | 03418nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-030-57852-7 | ||
003 | DE-He213 | ||
005 | 20240423125130.0 | ||
007 | cr nn 008mamaa | ||
008 | 200903s2020 sz | s |||| 0|eng d | ||
020 |
_a9783030578527 _9978-3-030-57852-7 |
||
024 | 7 |
_a10.1007/978-3-030-57852-7 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aTopics in Theoretical Computer Science _h[electronic resource] : _bThird IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1–2, 2020, Proceedings / _cedited by Luís S. Barbosa, Mohammad Ali Abam. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
300 |
_aIX, 117 p. 33 illus., 9 illus. in color. _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 ; _v12281 |
|
505 | 0 | _aDirac-based Reduction Techniques for Quantitative Analysis of Discrete-time Markov Models -- Combining Machine and Automata Learning for Network Traffic Classification -- On the complexity of the upper r-tolerant edge cover problem -- Margin-based Semi-supervised Learning Using Apollonius circle -- Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph -- Improved Algorithms for Distributed Balanced Clustering -- Finite Interval-Time Transition System for Real-Time Actors -- Path Planning with Objectives Minimum Length and Maximum Clearance. | |
520 | _aThis book constitutes the refereed proceedings of the Third IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2020, held in Tehran, Iran, in July 2020. The conference was held virtually due to the COVID-19 pandemic. The 8 papers presented in this volume were carefully reviewed and selected from 24 submissions. They focus on novel and high-quality research in all areas of theoretical computer science, such as algorithms and complexity; logic, semantics, and programming theory; and more. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aS. Barbosa, Luís. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aAli Abam, Mohammad. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030578510 |
776 | 0 | 8 |
_iPrinted edition: _z9783030578534 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12281 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-57852-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c174600 _d174600 |