Translator Disclaimer
2017 On Polynomial-Time Relation Reducibility
Su Gao, Caleb Ziegler
Notre Dame J. Formal Logic 58(2): 271-285 (2017). DOI: 10.1215/00294527-3867118

Abstract

We study the notion of polynomial-time relation reducibility among computable equivalence relations. We identify some benchmark equivalence relations and show that the reducibility hierarchy has a rich structure. Specifically, we embed the partial order of all polynomial-time computable sets into the polynomial-time relation reducibility hierarchy between two benchmark equivalence relations Eλ and id. In addition, we consider equivalence relations with finitely many nontrivial equivalence classes and those whose equivalence classes are all finite.

Citation

Download Citation

Su Gao. Caleb Ziegler. "On Polynomial-Time Relation Reducibility." Notre Dame J. Formal Logic 58 (2) 271 - 285, 2017. https://doi.org/10.1215/00294527-3867118

Information

Received: 10 February 2014; Accepted: 29 September 2014; Published: 2017
First available in Project Euclid: 3 March 2017

zbMATH: 06751303
MathSciNet: MR3634981
Digital Object Identifier: 10.1215/00294527-3867118

Subjects:
Primary: 03D15, 68Q15
Secondary: 68Q17

Rights: Copyright © 2017 University of Notre Dame

JOURNAL ARTICLE
15 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.58 • No. 2 • 2017
Back to Top