Complexity of equivalence relations and preorders from computability theory
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) S f(y)]. Here f is taken from a suitable class of effective functions. For us...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/107263 http://hdl.handle.net/10220/25392 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|