Efficient Amplifiers and Bounded Degree Optimization

Authors:
Berman Piotr;Karpinski Marek
Affiliations:
-;-
Venue:
Efficient Amplifiers and Bounded Degree Optimization
Year:
2001

Citing 0
Cited 2

Hardness of approximation for non-overlapping local alignments

Discrete Applied Mathematics
Complexity of approximating bounded variants of optimization problems

Theoretical Computer Science - Foundations of computation theory (FCT 2003)

Quantified Score

Hi-index	0.00

Visualization

Abstract