Return to Revisions

1 of 3

asked Apr 7, 2010 at 17:24

339
2
11

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⁰)?

set-theory computer-science

asked Apr 7, 2010 at 17:24

339
2
11