One-way permutations, computational asymmetry and distortion.
type: Item
instance of: scholarly article
title: One-way permutations, computational asymmetry and distortion.
zbMATH Open document ID: 1205.20044
author: J.-C. Birget
published in: Journal of Algebra
publication date: 2008-12-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/0704.1569
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 20F05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5382257
zbMATH Keywords: combinatorial group theory
zbMATH Keywords: complexity of transformations
zbMATH Keywords: word-length asymmetry functions
zbMATH Keywords: combinational circuits
zbMATH Keywords: Thompson monoids
zbMATH Keywords: Thompson groups
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2963385038
arXiv ID: 0704.1569
cites work: The monotone circuit complexity of Boolean functions
cites work: Metrics on diagram groups and uniform embeddings in a Hilbert space.
cites work: Logical Reversibility of Computation
cites work: Time/Space Trade-Offs for Reversible Computation
cites work: THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
cites work: CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
cites work: FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
cites work: On Lipschitz embedding of finite metric spaces in Hilbert space
cites work: One-way functions and circuit complexity
cites work: Introductory notes on Richard Thompson's groups
cites work: New directions in cryptography
cites work: The Extrinsic Geometry of Subgroups and the Generalized Word Problem
cites work: Conservative logic
cites work: Complexity Measures for Public-Key Cryptosystems
cites work: Q4370983
cites work: Q5027476
cites work: Q4341710
cites work: Q3249579
cites work: Q5692654
cites work: Q4774034
cites work: Q5464461
cites work: On subgroup distortion in finitely presented groups
cites work: LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
cites work: Q3758729
cites work: Lower bounds on monotone complexity of the logical permanent
cites work: Q4344138
cites work: A construction which can be used to produce finitely presented infinite simple groups
cites work: A survey of one-way functions in complexity theory
cites work: The gap between monotone and non-monotone circuit complexity is exponential
cites work: Q3867972
cites work: Q3886867
cites work: Q3998976
cites work: Q3762226
DOI: 10.1016/J.JALGEBRA.2008.05.035
description: scientific article