Minimum-complexity pairing functions

DOI10.1016/0022-0000(92)90027-GMaRDI QIDQ1201876zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• scientific article; zbMATH DE number 5292707
• scientific article; zbMATH DE number 2134154
• Fragments of arithmetic and pairing functions
• There is no safe pairing function over an arbitrary structure

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 4012593 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 3774850 (Why is no real title available?)
• scientific article; zbMATH DE number 3467029 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• Fast multiplication of large numbers
• On storing concatenable arrays
• Real-Time Definable Languages
• Some Results on Tape-Bounded Turing Machines
• Storage schemes for boundedly extendible arrays

Cited in

(8)

• Fragments of arithmetic and pairing functions
• Subrecursive equivalence relations and (non-)closure under lattice operations
• Forming all pairs in a minimal number of steps
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• Generality's price: Inescapable deficiencies in machine-learned programs
• Gap-languages and log-time complexity classes
• Polynomial time samplable distributions
• scientific article; zbMATH DE number 2134154 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201876)