On the structure of Boolean functions with small spectral norm (Q2012184): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
On the structure of boolean functions with small spectral norm
description / endescription / en
scientific article
scientific article; zbMATH DE number 6721558
Property / title
 
On the structure of boolean functions with small spectral norm (English)
Property / title: On the structure of boolean functions with small spectral norm (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1365.94682 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/2554797.2554803 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the 5th conference on Innovations in theoretical computer science / rank
 
Normal rank
Property / publication date
 
19 May 2017
Timestamp+2017-05-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 May 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6721558 / rank
 
Normal rank
Property / zbMATH Keywords
 
decision trees
Property / zbMATH Keywords: decision trees / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1951009694 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058883309 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.0371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Width Two Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Branching Programs on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice-based cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of properly learning simple concept classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity testing in characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions with low average sensitivity depend on few coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of circuits with gates of low \(L_{1}\) norms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Fourier Dimensionality and Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions with small spectral norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative version of the idempotent theorem in harmonic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Decision Trees Using the Fourier Spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication is Bounded by Root of Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of Boolean functions with small spectral norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5827965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parity complexity measures of Boolean functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:22, 14 July 2024

scientific article; zbMATH DE number 6721558
  • On the structure of boolean functions with small spectral norm
Language Label Description Also known as
English
On the structure of Boolean functions with small spectral norm
scientific article; zbMATH DE number 6721558
  • On the structure of boolean functions with small spectral norm

Statements

On the structure of Boolean functions with small spectral norm (English)
0 references
On the structure of boolean functions with small spectral norm (English)
0 references
0 references
0 references
0 references
0 references
0 references
28 July 2017
0 references
19 May 2017
0 references
0 references
0 references
analysis of Boolean functions
0 references
parity decision trees
0 references
spectral norm
0 references
decision trees
0 references
0 references
0 references
0 references
0 references
0 references
0 references