Minimum-complexity pairing functions

DOI10.1016/0022-0000(92)90027-GzbMath0769.68049OpenAlexW2011541295MaRDI QIDQ1201876

Kenneth W. Regan

Publication date: 17 January 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(92)90027-g

zbMATH Keywords

on-line computationconstant spacepairing functionlinear-time computabilitylog space

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Generality's price: Inescapable deficiencies in machine-learned programs ⋮ Gap-languages and log-time complexity classes ⋮ Polynomial time samplable distributions ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations

Cites Work

• Storage schemes for boundedly extendible arrays
• On storing concatenable arrays
• Fast multiplication of large numbers
• Real-Time Definable Languages
• Some Results on Tape-Bounded Turing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum-complexity pairing functions