Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
type: Item
instance of: scholarly article
title: Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
zbMATH Open document ID: 1341.05012
author: Itai Benjamini
author: Gil Cohen
author: Igor Shinkar
published in: Israel Journal of Mathematics
publication date: 2016-07-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1310.2017
Mathematics Subject Classification ID: 05A19
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6605986
zbMATH Keywords: computational complexity
zbMATH Keywords: Boolean circuits
MaRDI profile type: Publication
OpenAlex ID: W2406726738
arXiv ID: 1310.2017
cites work: A phase transition for the metric distortion of percolation on the hypercube
cites work: Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
cites work: The average sensitivity of bounded-depth circuits
cites work: Q5805073
cites work: Boolean functions with low average sensitivity depend on few coordinates
cites work: On the Implementation of Huge Random Objects
cites work: Q3800088
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: A note on the edges of the n-cube
cites work: Geometric properties of Poisson matchings
cites work: Q5519710
cites work: Q4549227
cites work: Bounded-depth circuits cannot sample good codes
cites work: Log Space Recognition and Translation of Parenthesis Languages
cites work: The complexity of distributions
cites work: Extractors for Circuit Sources
cites work: A course in combinatorics.
DOI: 10.1007/S11856-016-1302-0
description: scientific article