:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Yang, Jason
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2411.14676
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster search for tensor decomposition over finite fields
por: Yang, Jason
Publicado: (2025)

Concise tensors of minimal border rank
por: Jelisiejew, Joachim, et al.
Publicado: (2022)

New results in canonical polyadic decomposition over finite fields
por: Yang, Jason
Publicado: (2025)

Fixed-parameter tractability of canonical polyadic decomposition over finite fields
por: Yang, Jason
Publicado: (2024)

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

Classification and degenerations of small minimal border rank tensors via modules
por: Jagiełła, Jakub, et al.
Publicado: (2024)

Permanental rank versus determinantal rank of random matrices over finite fields
por: Ghasemi, Fatemeh, et al.
Publicado: (2025)

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

On the Chow-rank of the permanent
por: Xu, Rongyu, et al.
Publicado: (2023)

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

Tensor rank and dimension expanders
por: Dvir, Zeev
Publicado: (2025)

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

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

Symmetrization maps and minimal border rank Comon's conjecture
por: Mańdziuk, Tomasz, et al.
Publicado: (2024)

Low-Rank Tensor Decomposition over Finite Fields
por: Yang, Jason
Publicado: (2024)

Permanents of random matrices over finite fields
por: Hunter, Zach, et al.
Publicado: (2026)

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

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

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

A universal sequence of tensors for the asymptotic rank conjecture
por: Kaski, Petteri, et al.
Publicado: (2024)

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

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

Recovering polynomials over finite fields from noisy character values
por: Kopparty, Swastik
Publicado: (2026)

Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities
por: Byramji, Farzan, et al.
Publicado: (2025)

Modular composition & polynomial GCD in the border of small, shallow circuits
por: Andrews, Robert, et al.
Publicado: (2025)

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

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

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

Are Depth-2 Regular Expressions Hard to Intersect?
por: Ascone, Rocco, et al.
Publicado: (2025)

Optimal Depth-Three Circuits for Inner Product
por: Gurumukhani, Mohit, et al.
Publicado: (2026)

Depth lower bounds in Stabbing Planes for combinatorial principles
por: Dantchev, Stefan, et al.
Publicado: (2021)

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

Sketching approximability of all finite CSPs
por: Chou, Chi-Ning, et al.
Publicado: (2021)

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

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
por: Komarath, Balagopal, et al.
Publicado: (2025)

Optimal Monotone Depth-Three Circuit Lower Bounds for Majority
por: Gurumukhani, Mohit, et al.
Publicado: (2026)

Separations in query complexity for total search problems
por: Ben-David, Shalev, et al.
Publicado: (2024)

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
por: Jaffke, Lars, et al.
Publicado: (2025)

Finding quantum partial assignments by search-to-decision reductions
por: Weggemans, Jordi
Publicado: (2024)

Computational complexity of isometric tensor network states
por: Malz, Daniel, et al.
Publicado: (2024)