Login / Signup
Lower bounds on time complexity for some subgraph detection problems.
Masanari Arai
Masafumi Yamashita
Tomio Hirata
Toshihide Ibaraki
Namio Honda
Published in:
Systems and Computers in Japan (1986)
Keyphrases
</>
lower bound
upper bound
decision problems
average case complexity
np hard
optimization problems
worst case
false positives
detection algorithm
detection rate
linear programming relaxation
randomly generated problems
object detection
linear programming
np complete
face detection