1 citations · 2 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023
On the Rational Degree of Boolean Functions and Applications
Vishnu Iyer, Siddhartha Jain, Robin Kothari +5
We study a natural complexity measure of Boolean functions known as the rational degree. Denoted , it is the minimal degree of a rational function that is equal t…
cs.CC2022
Searching for Regularity in Bounded Functions
Siddharth Iyer, Michael Whitmeyer
Given a function on , we study the following problem. What is the largest affine subspace such that when restricted to , all the non-…