Skip to main content
Conference Proceedings

Upper Bound for Torus Polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2021) 12730 LNCS 257-263
DOI: 10.1007/978-3-030-79416-3_15
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that all functions that have low degree torus polynomials approximating them with small error also have MidBit+ circuits computing them. This serves as a partial converse to the result that all ACC functions have low degree torus polynomials approximating them with small error, by Bhrushundi, Hosseini, Lovett and Rao (ITCS 2019).

Author supplied keywords

Cite

CITATION STYLE

APA

Krishan, V. (2021). Upper Bound for Torus Polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12730 LNCS, pp. 257–263). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-79416-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free