Interplay between resiliency and polynomial degree — Recursive amplification, higher order sensitivity and beyond
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory, and far beyond in different areas of science and technology. In this paper we connect the tools of cryptology and complexity theory in the domain of resilient Boolean functions. It is well kn...
Saved in:
| Published in: | Discrete Applied Mathematics Vol. 365; pp. 138 - 159 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
15.04.2025
|
| Subjects: | |
| ISSN: | 0166-218X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!