Searching for "The Complexity of Finite Functions." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits
- … for the computational complexity of finite functions were proved using the Boolean circuit model of computation ([13…
- Cited by 1 (1 self) – Add To MetaCart
-
Applications of Polynomial and Rational Approximation. . .
- …. The complexity of finite functions. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume…
- Add To MetaCart
-
Forming Concepts for Fast Inference
- … or do not always exist would be a major result in the complexity of finite functions. An immediate…
- Cited by 46 (2 self) – Add To MetaCart
-
Reductions to Sets of Low Information Content
- … of finite functions. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 14, pages…
- Cited by 23 (5 self) – Add To MetaCart
-
Effective Interpolation
- …. (1990) Complexity of finite functions. in: Handbook of Theoretical Computer Science, ed. J. van Leeuwen…
- Add To MetaCart
-
Towards efficient constructions of hitting sets that derandomize BPP
- … the standard definition of circuitsize complexity of finite functions; moreover, given any boolean sequence ~x…
- Add To MetaCart
-
Representing Boolean Functions As Polynomials Modulo Composite Numbers
- … of finite functions; circuit complexity; computation by polynomials; relativized complexity. Subject…
- Cited by 50 (6 self) – Add To MetaCart
Showing 1 through 7.
