:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Viola, Emanuele
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/2507.08919
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Pseudorandomness, symmetry, smoothing: I
by: Derksen, Harm, et al.
Published: (2024)

Pseudorandomness, symmetry, smoothing: II
by: Derksen, Harm, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

On the complexity of Multipacking
by: Das, Sandip, et al.
Published: (2026)

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

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

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

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

Unambiguous parity-query complexity
by: Gavinsky, Dmytro
Published: (2024)

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

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

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

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

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

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

A weak regularity lemma for polynomials
by: Moshkovitz, Guy, et al.
Published: (2025)

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

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

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

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

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

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
by: Folea, Rares, et al.
Published: (2025)

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

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

On the complexity of covering points by guillotine cuts
by: Garijo, Delia, et al.
Published: (2026)

Undecidability of tiling the plane with a fixed number of Wang bars
by: Yang, Chao, et al.
Published: (2024)

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

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