Imagen de Portada

Hardness of clique approximation for monotone circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Błasiok, Jarosław, Meierhöfer, Linus
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR
por: Błasiok, Jarosław, et al.
Publicado: (2026)

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications
por: Błasiok, Jarosław, et al.
Publicado: (2021)

Hardness of approximation for ground state problems
por: Gharibian, Sevag, et al.
Publicado: (2024)

Low-degree approximation of QAC$^0$ circuits
por: Montanaro, Ashley, et al.
Publicado: (2024)

Towards infinite PCSP: a dichotomy for monochromatic cliques
por: Banakh, Demian, et al.
Publicado: (2026)

Dichotomies for \#CSP on graphs that forbid a clique as a minor
por: Meng, Boning, et al.
Publicado: (2025)

Hexasort -- The Complexity of Stacking Colors on Graphs
por: Klocker, Linus, et al.
Publicado: (2026)

Constructing self-referential instances for the clique problem
por: Li, Jiaqi, et al.
Publicado: (2026)

Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
por: Chavrimootoo, Michael C., et al.
Publicado: (2026)

Hardness of SetCover Reoptimization
por: Jansen, Klaus, et al.
Publicado: (2025)

On the Hardness of the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Bounds for Hardness Condensation in the Query Model
por: Kayal, Chandrima, et al.
Publicado: (2026)

Hardness Amplification via Group Theory
por: Nareddy, Tejas, et al.
Publicado: (2024)

Simple general magnification of circuit lower bounds
por: Atserias, Albert, et al.
Publicado: (2025)

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

Near Optimal Hardness of Approximating $k$-CSP
por: Minzer, Dor, et al.
Publicado: (2025)

On the Hardness of Order Finding and Equivalence Testing for ROABPs
por: Ramya, C., et al.
Publicado: (2025)

Higher Hardness Results for the Reconfiguration of Odd Matchings
por: Dorfer, Joseph
Publicado: (2026)

Hard-to-Sample Distributions from Robust Extractors
por: Byramji, Farzan, et al.
Publicado: (2026)

Tetris is Hard with Just One Piece Type
por: MIT Hardness Group, et al.
Publicado: (2026)

Hard CNF Instances for Ideal Proof Systems
por: Hakoniemi, Tuomas, et al.
Publicado: (2026)

Compression of Voxelized Vector Field Data by Boxes is Hard
por: Zhang, Simon
Publicado: (2025)

Constant-depth circuits for polynomial GCD over any characteristic
por: Bhattacharjee, Somnath, et al.
Publicado: (2025)

New Techniques for Constructing Rare-Case Hard Functions
por: Nareddy, Tejas, et al.
Publicado: (2024)

Optimal Proof Systems for Complex Sets are Hard to Find
por: Egidy, Fabian, et al.
Publicado: (2024)

On the Hardness of Finding Temporally Connected Subgraphs of Any Size
por: Casteigts, Arnaud, et al.
Publicado: (2026)

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
por: Chew, Leroy, et al.
Publicado: (2024)

Distributing mass under a pointwise bound and an application to weighted polynomial approximation
por: Bergqvist, Linus, et al.
Publicado: (2024)

On the approximability of graph visibility problems
por: Bilò, Davide, et al.
Publicado: (2024)

Worst-Case and Average-Case Hardness of Hypercycle and Database Problems
por: Fu, Cheng-Hao, et al.
Publicado: (2025)

PCP-free APX-Hardness of Nearest Codeword and Minimum Distance
por: Bhattiprolu, Vijay, et al.
Publicado: (2025)

On the NP-Hardness Approximation Curve for Max-2Lin(2)
por: Martinsson, Björn
Publicado: (2024)

Hardness of Hypergraph Edge Modification Problems
por: Gishboliner, Lior, et al.
Publicado: (2025)

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

An approximation notion between P and FPTAS
por: Bismuth, Samuel, et al.
Publicado: (2026)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
por: Sarkar, Rohit Sarma, et al.
Publicado: (2024)

Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification
por: Alman, Josh, et al.
Publicado: (2025)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
por: Digulescu, Mircea-Adrian
Publicado: (2026)

PSPACE-Hard 2D Super Mario Games: Thirteen Doors
por: MIT Hardness Group, et al.
Publicado: (2024)