|
|
|
|
|
|
by mumbisChungo
2164 days ago
|
|
|
Yes, a lower bound for multiplication using a boolean circuit, resting on an unproven conjecture. Even if the conjecture is proven to be true, we may find a more efficient way to perform this operation than a boolean circuit. |
|
|