Now showing items 1-1 of 1

    • Complexity of equivalence relations and preorders from computability theory 

      Ianovski, Egor; Miller, Russell; Ng, Keng Meng; Nies, Andre (2014)
      We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations R; S, a componentwise reducibility is de ned by R ≤ S ⇔ ∃f ∀x, y [xRy ↔ f(x) ...