5 citations · 8 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.CC2024
Approximate Degree Composition for Recursive Functions
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal +2
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have conc…
cs.CC2024
Relations between monotone complexity measures based on decision tree complexity
Farzan Byramji, Vatsal Jha, Chandrima Kayal +1
In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed wi…