Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
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⁰)?
Are there any known reversible pairing functions f: ℕ ⨉ ℕ → ℕ that can be computed in constant time (FAC⁰)?
Are there any known reversible pairing functions $f: \mathbb N \times \mathbb N \to \mathbb N$ that can be computed in constant time (FAC⁰)?
