Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Talk:Random self-reducibility

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 14 days ago by ~2026-39660-75

"If a CoNP-hard problem is random self-reducible in O(log n/n) then Σ2 = Π2."

O(log n/n) = O(log 1) = O(0) = 0

This can't be right. What should it say?

JumpDiscont (talk) 07:08, 5 July 2010 (UTC)Reply

shashank ~2026-39660-75 (talk) 02:54, 15 July 2026 (UTC)Reply