Assertion: polynomial time algorithm | /r/CapableOf | arise in reduction
Facets:
value: from an np-hard problem
type: OTHER
value: typically
type: DEGREE
value: to another problem
type: TRANSITIVE-OBJECT
Source sentences:
text: Quasi-polynomial time algorithms typically arise in reductions from an NP-hard problem to another problem.