Imagen de Portada

Communication complexity of pointer chasing via the fixed-set lemma

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Viola, Emanuele
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Pseudorandom bits for non-commutative programs
por: Lee, Chin Ho, et al.
Publicado: (2025)

Resilient functions: Optimized, simplified, and generalized
por: Ivanov, Peter, et al.
Publicado: (2024)

Boosting uniformity in quasirandom groups: fast and simple
por: Derksen, Harm, et al.
Publicado: (2024)

Pseudorandomness, symmetry, smoothing: I
por: Derksen, Harm, et al.
Publicado: (2024)

Pseudorandomness, symmetry, smoothing: II
por: Derksen, Harm, et al.
Publicado: (2024)

Average-case deterministic query complexity of boolean functions with fixed weight
por: Li, Yuan, et al.
Publicado: (2024)

Clunie lemma in several complex variables and application in PDEs
por: Hao, Wenjie, et al.
Publicado: (2024)

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications
por: Błasiok, Jarosław, et al.
Publicado: (2021)

Inapproximability of the independent set polynomial in the complex plane
por: Bezakova, Ivona, et al.
Publicado: (2017)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
por: Colli, Giordano
Publicado: (2025)

The complexity of computing in continuous time: space complexity is precision
por: Blanc, Manon, et al.
Publicado: (2024)

XOR Lemmas for Communication via Marginal Information
por: Iyer, Siddharth, et al.
Publicado: (2023)

On the enumeration of Tarski fixed points
por: Müller, Julian
Publicado: (2023)

On the complexity of Multipacking
por: Das, Sandip, et al.
Publicado: (2026)

The Schwarz lemma for holomorphic and minimal disks at the boundary
por: Kalaj, David
Publicado: (2025)

Schwarz lemma for harmonic functions in the unit ball
por: Xu, Zhenghua, et al.
Publicado: (2023)

Instance complexity of Boolean functions
por: Liu, Alison Hsiang-Hsuan, et al.
Publicado: (2023)

Unambiguous parity-query complexity
por: Gavinsky, Dmytro
Publicado: (2024)

Real non-attractive fixed point conjecture for complex harmonic functions
por: Vaseem, Mohd
Publicado: (2025)

Finiteness of the fixed point sets of automorphisms
por: Thiruvengadam, Bharathi, et al.
Publicado: (2026)

On complexity of restricted fragments of Decision DNNF
por: Calí, Andrea, et al.
Publicado: (2025)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
por: Chen, Lijie, et al.
Publicado: (2025)

Between the deterministic and non-deterministic query complexity
por: Gerbner, Dániel
Publicado: (2019)

Zalcman's lemma, Pinchuk's rescaling method, and Catlin's estimates revisited
por: Berteloot, François
Publicado: (2024)

Some structural complexity results for $\exists\mathbb R$
por: Meer, Klaus, et al.
Publicado: (2025)

Unconventional complexity classes in unconventional computing (extended abstract)
por: Porreca, Antonio E.
Publicado: (2024)

The complexity of convexity number and percolation time in the cycle convexity
por: Lima, Carlos V. G. C., et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
por: Folea, Rares, et al.
Publicado: (2025)

A primer on the closure of algebraic complexity classes under factoring
por: Bhargav, C. S., et al.
Publicado: (2025)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
por: Cai, Jin-Yi, et al.
Publicado: (2024)

On the complexity of embedding in graph products
por: Biedl, Therese, et al.
Publicado: (2023)

On postcritical sets of quadratic polynomials with a neutral fixed point
por: Qu, Hongyu
Publicado: (2024)

Positive Univariate Polynomials: SOS certificates, algorithms, bit complexity, and T-systems
por: Bender, Matías, et al.
Publicado: (2025)

On one-way functions and the average time complexity of almost-optimal compression
por: Zimand, Marius
Publicado: (2024)

Lower bounds for quantum-inspired classical algorithms via communication complexity
por: Mande, Nikhil S., et al.
Publicado: (2024)

Pseudodeterministic Communication Complexity
por: Göös, Mika, et al.
Publicado: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
por: Goubault-Larrecq, Aliénor, et al.
Publicado: (2025)

Low-soundness direct-product testers and PCPs from Kaufman--Oppenheim complexes
por: O'Donnell, Ryan, et al.
Publicado: (2025)