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...

Ամբողջական նկարագրություն

Պահպանված է:

Մատենագիտական մանրամասներ
Համատեղ հեղինակ:	SpringerLink (Online service)
Այլ հեղինակներ:	Goldreich, Oded (Խմբագիր)
Ձևաչափ:	Էլեկտրոնային էլ․ գիրք
Լեզու:	անգլերեն
Հրապարակվել է:	Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Հրատարակություն:	1st ed. 2025.
Շարք:	Lecture Notes in Computer Science, 15700
Խորագրեր:	Algorithms. Computational complexity. Mathematics > Data processing. Design and Analysis of Algorithms. Computational Complexity. Computational Mathematics and Numerical Analysis.
Առցանց հասանելիություն:	https://doi.org/10.1007/978-3-031-88946-2
Ցուցիչներ:	Ավելացրեք ցուցիչ Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!

Բովանդակություն:

-. 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.

Computational Complexity and Local Algorithms On the Interplay Between Randomness and Computation /

Նմանատիպ նյութեր