:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Yang, Jason
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2405.11699
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

New results in canonical polyadic decomposition over finite fields
par: Yang, Jason
Publié: (2025)

Faster search for tensor decomposition over finite fields
par: Yang, Jason
Publié: (2025)

Depth-first search for tensor rank and border rank over finite fields
par: Yang, Jason
Publié: (2024)

Low-Rank Tensor Decomposition over Finite Fields
par: Yang, Jason
Publié: (2024)

Permanents of random matrices over finite fields
par: Hunter, Zach, et autres
Publié: (2026)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
par: Carbonnel, Clément
Publié: (2026)

Complete and tractable machine-independent characterizations of second-order polytime
par: Hainry, Emmanuel, et autres
Publié: (2022)

Positive bias makes tensor-network contraction tractable
par: Jiang, Jiaqing, et autres
Publié: (2024)

Finitely (In)tractable Promise Constraint Satisfaction Problems
par: Asimi, Kristina, et autres
Publié: (2020)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
par: Bengali, Vedangi, et autres
Publié: (2024)

Recovering polynomials over finite fields from noisy character values
par: Kopparty, Swastik
Publié: (2026)

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

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
par: Li, Tiange, et autres
Publié: (2026)

On the Complexity of Combinatorial Optimization on Fixed Structures
par: Megiddo, Nimrod
Publié: (2024)

Minimum cost flow decomposition on arc-coloured networks
par: Neto, Claudio Carvalho, et autres
Publié: (2025)

Fixed-parameter debordering of Waring rank
par: Dutta, Pranjal, et autres
Publié: (2024)

A note about exponential tractability of linear weighted tensor product problems in the worst-case setting
par: Liu, Zirong, et autres
Publié: (2025)

Counting Triangulations of Fixed Cardinal Degrees
par: Chambers, Erin, et autres
Publié: (2025)

A Note on the Complexity of Bilevel Linear Programs in Fixed Dimensions
par: Ketkov, Sergey S., et autres
Publié: (2025)

Fixed Parameter Tractable Linearizability Monitoring
par: Han, Lee Zheng, et autres
Publié: (2025)

Sketching approximability of all finite CSPs
par: Chou, Chi-Ning, et autres
Publié: (2021)

$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
par: Yi, Yongming
Publié: (2026)

Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete
par: MIT Hardness Group, et autres
Publié: (2025)

NP-completeness of Tiling Finite Simply Connected Regions with a Fixed Set of Wang Tiles
par: Yang, Chao, et autres
Publié: (2024)

Quadratic Speedup for Computing Contraction Fixed Points
par: Chen, Xi, et autres
Publié: (2026)

Holomorphic maps sharing preimages over finitely generated fields
par: Pakovich, Fedor
Publié: (2025)

Nonuniform Deterministic Finite Automata over finite algebraic structures
par: Idziak, Paweł M., et autres
Publié: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
par: Nechesov, Andrey
Publié: (2024)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
par: Chen, Xi, et autres
Publié: (2026)

Consistent Query Answering over SHACL Constraints
par: Ahmetaj, Shqiponja, et autres
Publié: (2024)

Equations over Finite Monoids with Infinite Promises
par: Larrauri, Alberto, et autres
Publié: (2025)

Log canonical thresholds at infinity
par: Bivià-Ausina, Carles, et autres
Publié: (2026)

Local Correction of Linear Functions over the Boolean Cube
par: Amireddy, Prashanth, et autres
Publié: (2024)

Extractors for Polynomial Sources over $\mathbb{F}_2$
par: Chattopadhyay, Eshan, et autres
Publié: (2023)

A linear bound for the size of the finite terminal assembly of a directed non-cooperative tile assembly system
par: Ivanov, Sergiu, et autres
Publié: (2024)

Constant-depth circuits for polynomial GCD over any characteristic
par: Bhattacharjee, Somnath, et autres
Publié: (2025)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
par: Pintér, József, et autres
Publié: (2026)

Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
par: Raz, Ran
Publié: (2026)

VP, VNP and Algebraic Branching Programs over Min-Plus Semirings
par: Komarath, Balagopal, et autres
Publié: (2026)