Login / Signup
The Complexity of Planar Counting Problems.
Harry B. Hunt III
Madhav V. Marathe
Venkatesh Radhakrishnan
Richard Edwin Stearns
Published in:
SIAM J. Comput. (1998)
Keyphrases
</>
decision problems
problems involving
machine learning
worst case
optimization problems
application domains
solving problems
np hardness
real time
databases
e learning
linear programming
np complete
benchmark problems
practical problems
polynomial hierarchy