How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions? | IEEE Conference Publication | IEEE Xplore