Computational Complexity and Local Algorithms On the Interplay Between Randomness and Computation /
This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms. The works...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Vydání: | 1st ed. 2025. |
| Edice: | Lecture Notes in Computer Science,
15700 |
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-031-88946-2 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-88946-2 | ||
| 003 | DE-He213 | ||
| 005 | 20260810170315.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 250610s2025 sz | o |||| 0|eng d | ||
| 020 | |a 9783031889462 |9 978-3-031-88946-2 | ||
| 024 | 7 | |a 10.1007/978-3-031-88946-2 |2 doi | |
| 050 | 4 | |a QA9.58 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 005.13 |2 23 |
| 245 | 1 | 0 | |a Computational Complexity and Local Algorithms |h [electronic resource] : |b On the Interplay Between Randomness and Computation / |c edited by Oded Goldreich. |
| 250 | |a 1st ed. 2025. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2025. | |
| 300 | |a 1 online resource (X, 451 p. 11 illus.). |b 9 illus. in color. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15700 | |
| 505 | 0 | |a -. On defining PPT-search problems -- -. Multi-pseudodeterministic algorithms -- On counting t-cliques Mod 2 -- On coarse and fine approximate counting of t-cliques -- On the complexity of enumerating ordered sets -- On the Cook-Mertz Tree Evaluation procedure -- Solving Tree Evaluation in o(log n · log log n) space -- On parallel repetitions of interactive proof systems -- On locally-characterized expander graphs (a survey) -- On the Locally Testable Code of Dinur et al. (2021) -- On the lower bound on the length of relaxed Locally Decodable Codes -- On the relaxed LDC of BGHSV: A survey that corrects the record -- On the complexity of estimating the Effective Support Size -- Robust Self-Ordering versus Local Self-Ordering -- On Testing Hamiltonicity in the Bounded Degree Graph Model -- Testing Isomorphism in the Bounded-Degree Graph Model -- On Testing Isomorphism to a fixed graph in the Bounded-Degree Graph Model -- On Testing Asymmetry in the Bounded Degree Graph Model -- On the query complexity of testing local graph properties in the Bounded-Degree Graph Model -- Testing in the bounded-degree graph model with degree bound two -- On properties that are non-trivial to test -- One-Sided Error Testing of Monomials and Affine Subspaces -- On testing group properties. | |
| 520 | |a This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms. The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces. | ||
| 588 | |a Print version record. | ||
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Mathematics |x Data processing. | |
| 650 | 1 | 4 | |a Design and Analysis of Algorithms. |
| 650 | 2 | 4 | |a Computational Complexity. |
| 650 | 2 | 4 | |a Computational Mathematics and Numerical Analysis. |
| 700 | 1 | |a Goldreich, Oded. |e editor. |0 (orcid)0000-0002-4329-135X |1 https://orcid.org/0000-0002-4329-135X |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031889455 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031889479 |
| 830 | 0 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15700 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-88946-2 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-238 | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Focus Bundle Foundational Computer Science (SpringerNature-85408) | ||