Notre Dame Journal of Formal Logic

On Polynomial-Time Relation Reducibility

Su Gao and Caleb Ziegler

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
Notre Dame J. Formal Logic, Volume 58, Number 2 (2017), 271-285.

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

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1488510091

Digital Object Identifier
doi:10.1215/00294527-3867118

Mathematical Reviews number (MathSciNet)
MR3634981

Zentralblatt MATH identifier
06751303

Subjects
Primary: 03D15: Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17] 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) [See also 03D15, 68Q17, 68Q19]
Secondary: 68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) [See also 68Q15]

Keywords
polynomial-time relation reducibility strong reduction function finitary equivalence relations finite equivalence relations

Citation

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


Export citation

References

  • [1] A. Blass and Y. Gurevich, “Equivalence relations, invariants, and normal forms,” SIAM Journal on Computing, vol. 13 (1984), pp. 682–89.
  • [2] A. Blass and Y. Gurevich, “Equivalence relations, invariants, and normal forms, II,” pp. 24–42 in Logic and Machines: Decision Problems and Complexity (Münster, 1983), vol. 171 of Lecture Notes in Computer Science, Springer, Berlin, 1984.
  • [3] S. Buss, Y. Chen, J. Flum, S.-D. Friedman, and M. Müller, “Strong isomorphism reductions in complexity theory,” Journal of Symbolic Logic, vol. 76 (2011), pp. 1381–1402.
  • [4] J. Finkelstein and B. Hescott, “Polynomial time kernel reductions,” preprint, arxiv:1604.08558v1 [cs.CC].
  • [5] L. Fortnow and J. A. Grochow, “Complexity classes of equivalence problems revisited,” Information and Computation, vol. 209 (2011), pp. 748–63.
  • [6] J. E. Hopcroft and R. E. Tarjan, “Isomorphism of planar graphs,” pp. 131–152, 187–212 in Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), edited by R. E. Miller and J. W. Thatcher, Plenum, New York, 1972.
  • [7] G. L. Miller, “Graph isomorphism, general remarks,” Journal of Computer and System Sciences, vol. 18 (1979), pp. 128–42.
  • [8] C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, Mass., 1994.