Testing isomorphism of Boolean functions over finite abelian groups
From MaRDI portal
Cites work
- A polynomial bound in Freiman's theorem.
- A quantitative version of the idempotent theorem in harmonic analysis
- A unified framework for testing linear-invariant properties
- Algebraic property testing: the role of invariance
- An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer
- Analysis of Boolean Functions
- Boolean functions with small spectral norm
- Classification of cosets of the Reed-Muller code R(m-3,m)
- Efficient Conversion of Mixed Logical Dynamical Systems Into an Equivalent Piecewise Affine Form
- Every locally characterized affine-invariant property is testable
- Fourier growth of parity decision trees
- Fourier sparsity, spectral norm, and the log-rank conjecture
- scientific article; zbMATH DE number 1970438 (Why is no real title available?)
- k-forrelation optimally separates Quantum and classical query complexity
- Learning Decision Trees Using the Fourier Spectrum
- Local Decoding and Testing for Homomorphisms
- Minimalism in cryptography: the Even-Mansour scheme revisited
- Nearly tight bounds for testing function isomorphism
- Nearly tight bounds for testing function isomorphism
- New results for learning noisy parities and halfspaces
- On a Conjecture of Littlewood and Idempotent Measures
- On the structure of Boolean functions with small spectral norm
- Oracle Separation of BQP and PH
- Partially symmetric functions are efficiently isomorphism testable
- Pseudorandom generators for read-once branching programs, in any order
- Pseudorandom generators for width-3 branching programs
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates
- Pseudorandomness for regular branching programs via Fourier analysis
- Reed-Muller codes on complete intersections.
- Temporal Logic Control of Discrete-Time Piecewise Affine Systems
- Testing Boolean function isomorphism
- Testing Fourier dimensionality and sparsity
- Testing juntas
- Testing linear-invariant function isomorphism
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Tight lower bounds for testing linear isomorphism
- Towards optimal separations between quantum and randomized query complexities
This page was built for publication: Testing isomorphism of Boolean functions over finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346899)
