2 citations · 3 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
A nearly- depth lower bound for formulas with restriction on top
Hao Wu
One of the major open problems in complexity theory is to demonstrate an explicit function which requires super logarithmic depth, a.k.a, the versus pr…
cs.CC2023★ 2 cited
An Improved Composition Theorem of a Universal Relation and Most Functions via Effective Restriction
Hao Wu
Recently, Ivan Mihajlin and Alexander Smal proved a composition theorem of a universal relation and some function via so called xor composition, that is there exists some function…