Minimal pairs for polynomial time reducibilities

Authors:
Klaus Ambos-Spies
Affiliations:
Univ. Dortmund, Dortmund, W. Germany
Venue:
Computation theory and logic
Year:
1987

Citing 0
Cited 3

Uniformly hard languages

Theoretical Computer Science - Australasian computer science
Weak completeness notions for exponential time

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Multi-valued functions in computability theory

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.00

Visualization

Abstract