No online algorithm finds common induced subgraphs of size (2+ε)log₂n with probability bounded away from zero in Erdős–Rényi graphs G(n,1/2), while the optimum is (4-o(1))log₂n and greedy achieves (2-o(1))log₂n.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.
citing papers explorer
-
Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
No online algorithm finds common induced subgraphs of size (2+ε)log₂n with probability bounded away from zero in Erdős–Rényi graphs G(n,1/2), while the optimum is (4-o(1))log₂n and greedy achieves (2-o(1))log₂n.
-
Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.