DeepAI AI Chat
Log In Sign Up

Lower Bounds for Multiplication via Network Coding

by   Peyman Afshani, et al.
Aarhus Universitet

Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by Fürer, shows that two n-bit numbers can be multiplied via a boolean circuit of size O(n n · 4^^*n), where ^*n is the very slowly growing iterated logarithm. In this work, we prove that if a central conjecture in the area of network coding is true, then any constant degree boolean circuit for multiplication must have size Ω(n n), thus almost completely settling the complexity of multiplication circuits. We additionally revisit classic conjectures in circuit complexity, due to Valiant, and show that the network coding conjecture also implies one of Valiant's conjectures.


page 1

page 2

page 3

page 4


On the complexity of hazard-free circuits

The problem of constructing hazard-free Boolean circuits dates back to t...

Mitigating Censorship with Multi-Circuit Tor and Linear Network Coding

Anonymity networks are providing practical mechanisms to protect its use...

The Undecidability of Network Coding with some Fixed-Size Messages and Edges

We consider a network coding setting where some of the messages and edge...

Towards the Multiple Constant Multiplication at Minimal Hardware Cost

Multiple Constant Multiplication (MCM) over integers is a frequent opera...

Functional lower bounds for restricted arithmetic circuits of depth four

Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there ex...

Separating Circuits : Switching Lemmas and Random Restrictions

This was submitted as a final project for CS254B, taught by Li Yang Tan ...