Login / Signup
On the Complexity and Inapproximability of Shortest Implicant Problems.
Christopher Umans
Published in:
ICALP (1999)
Keyphrases
</>
computational complexity
np complete
decision problems
np hard
information retrieval
reinforcement learning
shortest path
application domains