Image de couverture de livre

On hardness of computing analytic Brouwer degree

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Chakraborty, Somnath
Format:	Preprint
Publié:	2023
Sujets:	Computational Complexity Combinatorics Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
par: Kunisky, Dmitriy, et autres
Publié: (2024)

An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds
par: Kush, Deepanshu
Publié: (2026)

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

Optimal Union Probability Interval Is NP-Hard
par: Kaski, Petteri, et autres
Publié: (2026)

Decay of correlations and zeros for the hard-core model
par: Peters, Han, et autres
Publié: (2026)

Separating complexity classes of LCL problems on grids
par: Berlow, Katalin, et autres
Publié: (2025)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
par: Li, Rupert, et autres
Publié: (2025)

Universality for roots of derivatives of entire functions via finite free probability
par: Campbell, Andrew, et autres
Publié: (2024)

Polynomial-time sampling despite disorder chaos
par: Ma, Eric, et autres
Publié: (2025)

Some easy optimization problems have the overlap-gap property
par: Li, Shuangping, et autres
Publié: (2024)

On the degree of polynomials computing square roots mod p
par: Kedlaya, Kiran, et autres
Publié: (2023)

Direct Product Primality Testing of Graphs is GI-hard
par: Calderoni, Luca, et autres
Publié: (2020)

King Chasing Problem in Chinese Chess is NP-hard
par: Li, Chao, et autres
Publié: (2026)

Between proper and square coloring of planar graphs, hardness and extremal graphs
par: Delépine, Thomas
Publié: (2026)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
par: Gan, Luyining, et autres
Publié: (2023)

Infinite circle patterns in the Weil-Petersson class
par: Lam, Wai Yeung
Publié: (2026)

Sharp Online Hardness for Large Balanced Independent Sets
par: Dhawan, Abhishek, et autres
Publié: (2025)

The stochastic block model has the overlap graph property for modularity
par: Bhamidi, Shankar, et autres
Publié: (2026)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2024)

Inference of rankings planted in random tournaments
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Statistical inference of a ranked community in a directed graph
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
par: Gamarnik, David, et autres
Publié: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2026)

Computing the EHZ capacity is NP-hard
par: Leipold, Karla, et autres
Publié: (2024)

Bounded degree QBF and positional games
par: Oijid, Nacim
Publié: (2024)

Low-degree learning and the metric entropy of polynomials
par: Eskenazis, Alexandros, et autres
Publié: (2022)

On the hardness of recognizing graphs of small mim-width and its variants
par: la Tour, Max Dupré, et autres
Publié: (2025)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
par: Ikenmeyer, Christian, et autres
Publié: (2022)

Random infinite ideal angled graphs and ideal hyperbolic polyhedra
par: Ge, Huabin, et autres
Publié: (2026)

On full-separating sets and related codes in graphs
par: Chakraborty, Dipayan, et autres
Publié: (2024)

The Interplay Between Domination and Separation in Graphs
par: Chakraborty, Dipayan, et autres
Publié: (2026)

Complex analytic proofs of two probabilistic theorems
par: Markowsky, Greg, et autres
Publié: (2025)

The Probability Spaces of QuickSort
par: Nadareishvili, George, et autres
Publié: (2025)

Upper Bounds for Symmetric Approximate Bounded Indistinguishability
par: Williamson, Christopher
Publié: (2026)

Lines in Every Direction with No ee-Random Points
par: Lutz, Neil, et autres
Publié: (2025)

Perfect sampling from rapidly mixing Markov chains
par: Göbel, Andreas, et autres
Publié: (2024)

Rigorous Implications of the Low-Degree Heuristic
par: Hsieh, Jun-Ting, et autres
Publié: (2026)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
par: Tulsiani, Madhur, et autres
Publié: (2024)

Inconsistency Probability of Sparse Equations over F2
par: Horak, P., et autres
Publié: (2026)

Pseudorandomness of the Sticky Random Walk
par: Anand, Emile, et autres
Publié: (2023)