Skip to content
<title>Channels - Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
Search for more channels:
Similar Items: Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
Channel Options
View Record
Explore related channels
Quick Look
Hard CNF Instances for Ideal Proof Systems
Quick Look
Towards infinite PCSP: a dichotomy for monochromatic cliques
Quick Look
Average Attention Transformers and Arithmetic Circuits
Quick Look
Hardness Amplification for (Sparse) LPN
Quick Look
Hard-to-Sample Distributions from Robust Extractors
Quick Look
Optimal Union Probability Interval Is NP-Hard
Quick Look
Multi-Prover Interactive Proof Systems with Leakage
Quick Look
On the Hardness of Finding Temporally Connected Subgraphs of Any Size
Quick Look
Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
Quick Look
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
Quick Look
The Complexity of Stoquastic Sparse Hamiltonians
Quick Look
On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
Quick Look
Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
Quick Look
On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
Quick Look
Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
Quick Look
Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
Quick Look
Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model
Quick Look
The Exact Replica Threshold for Nonlinear Moments of Quantum States
Quick Look
Boolean PCSPs through the lens of Fourier Analysis
Quick Look
Constructive Separations from Gate Elimination
Quick Look
Polynomial-time completion of phylogenetic tree sets
Quick Look
On Detecting $H$-Induced Minors for Small $H$
Quick Look
Maximum Matching and Related Problems in Catalytic Logspace
Quick Look
Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
Load more items
View Record
Prev
Explore related channels
Next
