Equivalence relations, invariants, and normal forms

Authors:
Andreas Blass;Yuri Gurevich
Affiliations:
-;-
Venue:
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Year:
1983

Citing 0
Cited 5

History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation
Fine hierarchies and m-reducibilities in theoretical computer science

Theoretical Computer Science
The shrinking property for NP and coNP

Theoretical Computer Science
Complexity classes of equivalence problems revisited

Information and Computation
Yuri, logic, and computer science

Fields of logic and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract