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

Revision as of 21:10, 13 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

instance of

scholarly article

0 references

title

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

zbMATH Open document ID

1371.94704

0 references

1365.94682

0 references

DOI

10.1007/s00037-015-0110-y

0 references

10.1145/2554797.2554803

0 references

0 references

0 references

0 references

Computational Complexity

0 references

Proceedings of the 5th conference on Innovations in theoretical computer science

0 references

publication date

28 July 2017

0 references

19 May 2017

0 references

full work available at URL

https://arxiv.org/abs/1304.0371

0 references

Mathematics Subject Classification ID

0 references

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

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

0 references

Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)

0 references

Bounds for Width Two Branching Programs

0 references

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Fully homomorphic encryption using ideal lattices

0 references

Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Evaluating Branching Programs on Encrypted Data

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

New lattice-based cryptographic constructions

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2012184

@@ Property / cites work @@
+Q4526993
@@ Property / cites work: Q4526993 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Bounds for Width Two Branching Programs
@@ Property / cites work: Bounds for Width Two Branching Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
+Normal rank
@@ Property / cites work @@
+(Leveled) fully homomorphic encryption without bootstrapping
+Normal rank
@@ Property / cites work @@
+Efficient Fully Homomorphic Encryption from (Standard) LWE
+Normal rank
@@ Property / cites work @@
+Fully homomorphic encryption using ideal lattices
@@ Property / cites work: Fully homomorphic encryption using ideal lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
+Normal rank
@@ Property / cites work @@
+Trapdoors for hard lattices and new cryptographic constructions
+Normal rank
@@ Property / cites work @@
+Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
+Normal rank
@@ Property / cites work @@
+Evaluating Branching Programs on Encrypted Data
@@ Property / cites work: Evaluating Branching Programs on Encrypted Data / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
+Normal rank
@@ Property / cites work @@
+Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
+Normal rank
@@ Property / cites work @@
+Public-key cryptosystems from the worst-case shortest vector problem
+Normal rank
@@ Property / cites work @@
+New lattice-based cryptographic constructions
@@ Property / cites work: New lattice-based cryptographic constructions / rank @@
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+A hierarchy of polynomial time lattice basis reduction algorithms
+Normal rank