On the public citation graph
The Monotone Complexity of $k$-Clique on Random Graphs
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<457::aid-rsa14>3.0.co;2-wopenalex-snapshot
Finding a large hidden clique in a random graph
inferredcites →https://doi.org/10.1002/rsa.3240010209openalex-snapshot
Poisson approximation for large deviations
inferredcites →https://doi.org/10.1007/bf02579196openalex-snapshot
The monotone circuit complexity of boolean functions
inferredcites →https://doi.org/10.1007/s00037-010-0288-yopenalex-snapshot
k-Subgraph Isomorphism on AC0 Circuits
inferredcites →https://doi.org/10.1016/0020-0190(92)90184-wopenalex-snapshot
A simple lower bound for monotone clique using a communication game
inferredcites →https://doi.org/10.1023/a:1008374125234openalex-snapshot
Hiding Cliques for Cryptographic Security
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1137/s0097539701396959openalex-snapshot
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20550openalex-snapshot
On independent sets in random graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_25openalex-snapshot
Monotone Circuit Lower Bounds from Robust Sunflowers
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_15openalex-snapshot
Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight
inferred← citeshttps://doi.org/10.1007/s00037-019-00179-2openalex-snapshot
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
inferred← citeshttps://doi.org/10.1007/s00453-021-00813-yopenalex-snapshot
Beating Treewidth for Average-Case Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1007/s00453-022-01000-3openalex-snapshot
Monotone Circuit Lower Bounds from Robust Sunflowers
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.001openalex-snapshot
Cliques enumeration and tree-like resolution proofs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.042openalex-snapshot
On the average-case complexity of parameterized clique
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.038openalex-snapshot
Circuit lower bounds from learning-theoretic approaches
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116192openalex-snapshot
Average-case query complexity of fixed-weight boolean functions and k-CNFs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00063openalex-snapshot
Top-Down Lower Bounds for Depth-Four Circuits
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00132openalex-snapshot
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles
inferred← citeshttps://doi.org/10.1142/9789813272880_0187openalex-snapshot
LOWER BOUNDS FOR SUBGRAPH ISOMORPHISM
inferred← citeshttps://doi.org/10.1145/2499937.2499941openalex-snapshot
Parameterized Complexity of DPLL Search Procedures
inferred← citeshttps://doi.org/10.1145/3188745.3188838openalex-snapshot
Monotone circuit lower bounds from resolution
inferred← citeshttps://doi.org/10.1145/3188745.3188856openalex-snapshot
Clique is hard on average for regular resolution
inferred← citeshttps://doi.org/10.1145/3313276.3316323openalex-snapshot
DNF sparsification beyond sunflowers
inferred← citeshttps://doi.org/10.1145/3313276.3316339openalex-snapshot
A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem
inferred← citeshttps://doi.org/10.1145/3357713.3384234openalex-snapshot
Improved bounds for the sunflower lemma
inferred← citeshttps://doi.org/10.1145/3449352openalex-snapshot
Clique Is Hard on Average for Regular Resolution
inferred← citeshttps://doi.org/10.1145/3798129.3800822openalex-snapshot
Memory Reallocation with Polylogarithmic Overhead
inferred← citeshttps://doi.org/10.1145/3798129.3800911openalex-snapshot
Negations Are Powerful Even in Small Depth
inferred← citeshttps://doi.org/10.1145/3812802openalex-snapshot
Depth-3 Circuit Lower Bounds for \(k\) -OV
inferred← citeshttps://doi.org/10.11606/d.45.2020.tde-25112020-162107openalex-snapshot
Sunflowers theorems in computational complexity
inferred← citeshttps://doi.org/10.1214/21-aos2123openalex-snapshot
Tensor clustering with planted structures: Statistical optimality and computational limits
inferred← citeshttps://doi.org/10.4007/annals.2021.194.3.5openalex-snapshot
Improved bounds for the sunflower lemma
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2019.24openalex-snapshot
Beating Treewidth for Average-Case Subgraph Isomorphism
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02071openalex-snapshot
On Percolation and $NP$-Hardness
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06130openalex-snapshot
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
inferred← citeshttps://doi.org/10.48550/arxiv.1908.08483openalex-snapshot
Improved bounds for the sunflower lemma
inferred← citeshttps://doi.org/10.48550/arxiv.2005.08099openalex-snapshot
Reducibility and Statistical-Computational Gaps from Secret Leakage
inferred← citeshttps://doi.org/10.5753/ctd.2021.15761openalex-snapshot
Sunflower Theorems in Monotone Circuit Complexity
inferred← citeshttps://doi.org/10.7916/d8zp45ktopenalex-snapshot
Unconditional Lower Bounds in Complexity Theory
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.