:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autore principale:	Zimand, Marius
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity
Accesso online:	https://arxiv.org/abs/2412.03392
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computable one-way functions on the reals
di: Barmpalias, George, et al.
Pubblicazione: (2024)

Generalized one-way function and its application
di: Yin, Hua-Lei
Pubblicazione: (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
di: Folea, Rares, et al.
Pubblicazione: (2025)

Random regular graph states are complex at almost any depth
di: Ghosh, Soumik, et al.
Pubblicazione: (2024)

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

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

On the average-case complexity of learning output distributions of quantum circuits
di: Nietner, Alexander, et al.
Pubblicazione: (2023)

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

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

Quantum computational complexity of matrix functions
di: Cifuentes, Santiago, et al.
Pubblicazione: (2024)

Query complexity of Boolean functions on the middle slice of the cube
di: Gerbner, Dániel, et al.
Pubblicazione: (2023)

A Subexponential Reduction from Product Partition to Subset Sum
di: Costandin, Marius
Pubblicazione: (2024)

On the envelope of Poisson functional on almost complex manifolds
di: Bertrand, Florian, et al.
Pubblicazione: (2023)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
di: Derakhshan, Mahsa, et al.
Pubblicazione: (2025)

On query complexity measures and their relations for symmetric functions
di: Mittal, Rajat, et al.
Pubblicazione: (2021)

Quantum and classical query complexities of functions of matrices
di: Montanaro, Ashley, et al.
Pubblicazione: (2023)

Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries
di: Chen, Mark, et al.
Pubblicazione: (2025)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
di: Li, Tiange, et al.
Pubblicazione: (2026)

Orthogonal almost complex structure and its Nijenhuis tensor
di: Tang, Zizhou, et al.
Pubblicazione: (2024)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
di: Enright, Jessica, et al.
Pubblicazione: (2020)

On the complexity of Multipacking
di: Das, Sandip, et al.
Pubblicazione: (2026)

Linear average-case complexity of algorithmic problems in groups
di: Olshanskii, Alexander, et al.
Pubblicazione: (2022)

Unambiguous parity-query complexity
di: Gavinsky, Dmytro
Pubblicazione: (2024)

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
di: Suruga, Daiki
Pubblicazione: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
di: Büsing, Christina, et al.
Pubblicazione: (2025)

On the complexity of symmetric vs. functional PCSPs
di: Nakajima, Tamio-Vesa, et al.
Pubblicazione: (2022)

Exponential improvements to the average-case hardness of BosonSampling
di: Bouland, Adam, et al.
Pubblicazione: (2024)

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

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
di: Ketkov, Sergey S., et al.
Pubblicazione: (2024)

On one filtration of holomorphic functions
di: Jacobzon, Fiana
Pubblicazione: (2025)

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

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
di: Tate, Elise, et al.
Pubblicazione: (2025)

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

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

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

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

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

Communication complexity of pointer chasing via the fixed-set lemma
di: Viola, Emanuele
Pubblicazione: (2025)

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

On the class of almost subadditive weight functions
di: Schindl, Gerhard
Pubblicazione: (2024)