:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xu, Rongyu, Gnang, Edinah
Format:	Preprint
Published:	2023
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/2311.05890
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A proof of the Kotzig-Ringel-Rosa Conjecture
by: Gnang, Edinah K.
Published: (2022)

Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)

Two Proofs of the Hamiltonian Cycle Identity
by: Sawczuk, Hamilton, et al.
Published: (2025)

On the complexity of Chow and Hurwitz forms
by: Doğan, Mahmut Levent, et al.
Published: (2022)

Depth-first search for tensor rank and border rank over finite fields
by: Yang, Jason
Published: (2024)

Tensor rank and dimension expanders
by: Dvir, Zeev
Published: (2025)

Refuting approaches to the log-rank conjecture for XOR functions
by: Hatami, Hamed, et al.
Published: (2023)

Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT
by: Yang, Jason
Published: (2024)

A Proof of the Tree Packing Conjecture
by: Chalise, Parikshit, et al.
Published: (2024)

Every tree on $n$ edges decomposes $K_{nx,nx}$ and $K_{2nx+1}$
by: Chalise, Parikshit, et al.
Published: (2024)

Maker-Maker games of rank 4 are PSPACE-complete
by: Galliot, Florian, et al.
Published: (2025)

Strength and partition rank under limits and field extensions
by: Bik, Arthur, et al.
Published: (2025)

Bounds for Geometric rank in Terms of Subrank
by: Chen, Qiyuan, et al.
Published: (2025)

Errett Bishop theorems on Complex Analytic Sets: Chow's Theorem Revisited and Foliations with all leaves Compact on Kähler Manifolds
by: Aguilar, Carlos Martínez, et al.
Published: (2021)

Switching Graph Matrix Norm Bounds: from i.i.d. to Random Regular Graphs
by: Xu, Jeff
Published: (2024)

Slice rank and partition rank of the determinant
by: Lampert, Amichai, et al.
Published: (2025)

Inference of rankings planted in random tournaments
by: Kunisky, Dmitriy, et al.
Published: (2024)

Strongly Refuting Random CSP without Literals
by: Chan, Siu On, et al.
Published: (2026)

Fixed-parameter debordering of Waring rank
by: Dutta, Pranjal, et al.
Published: (2024)

Discreteness of asymptotic tensor ranks
by: Briët, Jop, et al.
Published: (2023)

Statistical inference of a ranked community in a directed graph
by: Kunisky, Dmitriy, et al.
Published: (2024)

rank-3 generalized Clifford manifold and its twistor space
by: Ren, Guangzhen, et al.
Published: (2026)

Apportionable matrices and gracefully labelled graphs
by: Clark, Antwan, et al.
Published: (2023)

Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
by: Dourado, Mitre C., et al.
Published: (2023)

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

Asymptotic tensor rank is characterized by polynomials
by: Christandl, Matthias, et al.
Published: (2024)

An Overview of the Theory of Instances Computational Complexity
by: Jorge A. Ruiz-Vanoye
Published: (2011)

Ask, and it shall be given: On the Turing completeness of prompting
by: Qiu, Ruizhong, et al.
Published: (2024)

On the Computational Hardness of Transformers
by: Saha, Barna, et al.
Published: (2026)

Nonlocal Games in the High-Noise Regime: Optimal Quantum Values and Rigidity
by: Fu, Honghao, et al.
Published: (2025)

Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming
by: Alman, Josh, et al.
Published: (2023)

Baby PIH: Parameterized Inapproximability of Min CSP
by: Guruswami, Venkatesan, et al.
Published: (2023)

Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation
by: Çivril, Ali
Published: (2023)

Top-Down Lower Bounds for Depth-Four Circuits
by: Göös, Mika, et al.
Published: (2023)

Two-State Spin Systems with Negative Interactions
by: Fei, Yumou, et al.
Published: (2023)

Canonization of a random graph by two matrix-vector multiplications
by: Verbitsky, Oleg, et al.
Published: (2023)

Heuristics Optimization of Boolean Circuits with application in Attribute Based Encryption
by: Ionita, Alexandru, et al.
Published: (2023)

Corrigendum: PLS is contained in PLC
by: Ishizuka, Takashi
Published: (2023)

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

On the Existence of Seedless Condensers: Exploring the Terrain
by: Chattopadhyay, Eshan, et al.
Published: (2023)