Minimum-complexity pairing functions
From MaRDI portal
Publication:1201876
DOI10.1016/0022-0000(92)90027-GzbMATH Open0769.68049OpenAlexW2011541295MaRDI QIDQ1201876FDOQ1201876
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Fast multiplication of large numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Results on Tape-Bounded Turing Machines
- Real-Time Definable Languages
- Storage schemes for boundedly extendible arrays
- Title not available (Why is that?)
- On storing concatenable arrays
- Title not available (Why is that?)
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
- Title not available (Why is that?)
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)
