One-Way Communication Complexity and Formula Size: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:4103:41, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,802 bytes +2,802‎ Created page with "Title: One-Way Communication Complexity and Formula Size Abstract: This research investigates the relationship between one-way communication complexity and the size of formulae in various scenarios, including probabilistic, nondeterministic, and quantum formulae. The study uses the Neˇciporuk method, a technique for proving lower bounds on the size of Boolean formulae, and applies it to the context of one-way communication complexity. The main results include polynomia..."
Retrieved from "https://simplesci.org/wiki/One-Way_Communication_Complexity_and_Formula_Size"