:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Junchi, Ma, Weilin, Chen, Chen, Wang, Defu, Lin, Chao, Wang
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/2405.03609
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Two Graphs: Resolving the Periodic Reversibility of One-dimensional Finite Cellular Automata
by: Wang, Chen, et al.
Published: (2024)

Characterization of the set of zero-noise limits measures of perturbed cellular automata
by: Marsan, Hugo, et al.
Published: (2024)

Word problems and embedding-obstructions in cellular automata groups on groups
by: Salo, Ville
Published: (2025)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
by: Wang, Chen, et al.
Published: (2023)

Complexity of Boolean automata networks under block-parallel update modes
by: Perrot, Kévin, et al.
Published: (2024)

On the complexity of freezing automata networks of bounded pathwidth
by: Goles, Eric, et al.
Published: (2025)

Holomorphic null curves in the special linear group
by: Alarcon, Antonio, et al.
Published: (2025)

Entropy of pebble automata and space complexity
by: Montoya, J. Andres
Published: (2026)

The PCP-like Theorem for Sub-linear Time Inapproximability
by: Ma, Hengzhao, et al.
Published: (2021)

Solving convex QPs with structured sparsity under indicator conditions
by: Bienstock, Daniel, et al.
Published: (2024)

Efficient algorithms for collecting the statistics of large-scale IP address data
by: Liu, Hui, et al.
Published: (2021)

Complete ergodicity in one-dimensional reversible cellular automata
by: Shiraishi, Naoto, et al.
Published: (2024)

Classical and quantum Merlin-Arthur automata
by: Yakaryılmaz, Abuzer
Published: (2022)

Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)

A linear bound for the size of the finite terminal assembly of a directed non-cooperative tile assembly system
by: Ivanov, Sergiu, et al.
Published: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
by: Jiao, Xianqi, et al.
Published: (2024)

Rank Bounds and PIT for $Σ^3 ΠΣΠ^d$ circuits via a non-linear Edelstein-Kelly theorem
by: Garg, Abhibhav, et al.
Published: (2025)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
by: Goles, Eric, et al.
Published: (2026)

Encoding of algebraic geometry codes with quasi-linear complexity $O(N\log N)$
by: Li, Songsong, et al.
Published: (2024)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
by: Ming, Gao
Published: (2022)

Exact spectral gaps of random one-dimensional quantum circuits
by: Deneris, Andrew E., et al.
Published: (2024)

Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
by: Ostonov, Azimkhon, et al.
Published: (2023)

When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?
by: Chen, Yuansi, et al.
Published: (2023)

An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate
by: Daskin, Ammar
Published: (2024)

Hazard-free Decision Trees
by: Benson, Deepu, et al.
Published: (2025)

Undecidability of Translational Tiling of the 4-dimensional Space with a Set of 4 Polyhypercubes
by: Yang, Chao, et al.
Published: (2024)

Undecidability of Translational Tiling of the 3-dimensional Space with a Set of 6 Polycubes
by: Yang, Chao, et al.
Published: (2024)

Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
by: Gupta, Rishav, et al.
Published: (2026)

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

From FPT Decision to FPT Enumeration
by: Creignou, Nadia, et al.
Published: (2025)

Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH
by: Li, Shuangle, et al.
Published: (2024)

Injective hardness condition for PCSPs
by: Banakh, Demian, et al.
Published: (2024)

Explaining the Ubiquity of Phase Transitions in Decision Problems
by: Jackson, Andrew
Published: (2025)

Search versus Decision for $\mathsf{S}_2^\mathsf{P}$
by: Fortnow, Lance
Published: (2025)

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

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

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
by: Guruswami, Venkatesan, et al.
Published: (2024)

Marginal Fairness: Fair Decision-Making under Risk Measures
by: Huang, Fei, et al.
Published: (2025)

Phase Transitions in Decision Problems Over Odd-Sized Alphabets
by: Jackson, Andrew
Published: (2025)

Upper and Lower Bounds on $T_1$ and $T_2$ Decision Tree Model
by: Alhamdan, Yousef M.
Published: (2025)