On &ggr;-reducibility versus polynomial time many-one reducibility(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
The complexity of unions of disjoint sets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Hi-index | 0.00 |