Are there any known reversible pairing functions f: ℕ ⨉ ℕ → ℕ $f: \mathbb N \times \mathbb N \to \mathbb N$ that can be computed in constant time (FAC⁰)?
|
3 | fixed some TeX | ||
|
|
||||
|
|
2 |
edited tags
|
||
|
|
1 |
|
||
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⁰)?
|
||||
