Return to Revisions

2 of 3

edited tags

edited Apr 7, 2010 at 23:14

François G. Dorais

44.4k
6
150
233

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

Are there any known reversible pairing functions f: ℕ ⨉ ℕ → ℕ that can be computed in constant time (FAC⁰)?

computer-science computational-complexity

asked Apr 7, 2010 at 17:24

339
2
11