Return to Revisions

3 of 3

fixed some TeX

edited Apr 8, 2010 at 2:41

Theo Johnson-Freyd

54.6k
10
142
336

Are there any pairing functions computable in constant time (AC⁰)

Are there any known reversible pairing functions $f: \mathbb N \times \mathbb N \to \mathbb N$ that can be computed in constant time (FAC⁰)?

computer-science computational-complexity

asked Apr 7, 2010 at 17:24

339
2
11