:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Porreca, Antonio E.
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/2405.16896
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

How to fit large complexity classes into TFNP
by: Thapen, Neil
Published: (2024)

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

Physical complexity and black hole quantum computers
by: Reilly, Michele, et al.
Published: (2025)

On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

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)

Reducing the complexity of computing the values of a Nash equilibrium
by: Chatterjee, Debtoru, et al.
Published: (2025)

A universal bound on the space complexity of Directed Acyclic Graph computations
by: Bilardi, Gianfranco, et al.
Published: (2024)

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

Correspondences in computational and dynamical complexity II: forcing complex reductions
by: Everett, Samuel
Published: (2026)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
by: Sakamoto, Kazuki, et al.
Published: (2025)

Self-Assembly of Patterns in the abstract Tile Assembly Model
by: Drake, Phillip, et al.
Published: (2024)

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

Identification of L-functions in the extended Selberg class by preimages of finite sets
by: Kundu, Arpita, et al.
Published: (2026)

Is a LOCAL algorithm computable?
by: Cruciani, Antonio, et al.
Published: (2026)

On the computational power of $C$-random strings
by: Milovanov, Alexey
Published: (2024)

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

Time hierarchies for sublogarithmic-space quantum computation
by: Say, A. C. Cem
Published: (2025)

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

Phase transition in the computational complexity of the shortest common superstring and genome assembly
by: Fernandez, L. A., et al.
Published: (2022)

Limit on the computational power of $\mathrm{C}$-random strings
by: Milovanov, Alexey
Published: (2026)

On the power of counting the total number of computation paths of NPTMs
by: Bakali, Eleni, et al.
Published: (2023)

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

Continuously non-extendable mappings between generalized complex ellipsoids of different dimensions
by: Hayashimoto, Atsushi
Published: (2024)

Fast polynomial computations with space constraints
by: Grenet, Bruno
Published: (2025)

The computational power of discrete chemical reaction networks with bounded executions
by: Doty, David, et al.
Published: (2024)

A computing machinery using a continuous memory tape
by: Oktar, Yigit
Published: (2023)

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

Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)

Man, these New York Times games are hard! A computational perspective
by: Alberti, Alessandro Giovanni, et al.
Published: (2025)

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

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

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

Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)

Stochastic thermodynamics of computation
by: Wolpert, David H.
Published: (2019)

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

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