Pages that link to "Item:Q5419039"
From MaRDI portal
The following pages link to The Monotone Complexity of $k$-Clique on Random Graphs (Q5419039):
Displaying 13 items.
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Improved bounds for the sunflower lemma (Q2058613) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- On the average-case complexity of parameterized clique (Q2344729) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- (Q5009548) (← links)
- Coding for Sunflowers (Q5126764) (← links)
- (Q5140848) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
