Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
On the Approximate Non-Deterministic Degree of Total Boolean Functions
Samruddhi Pednekar, Supartha Podder
The approximate non-deterministic degree of a Boolean function , denoted (written for brevity), is the minimum degree of a real polynomi…
cs.CC2026
Modifications of Quantum Computation and Adaptive Queries to PP
David Miloschewsky, Supartha Podder
In 2004, Aaronson introduced the complexity class ( with postselection) and showed that it is equal to . Following their line of work,…