Login / Signup
The Complexity of Acyclic Subhypergraph Problems.
David Duris
Yann Strozecki
Published in:
WALCOM (2011)
Keyphrases
</>
np complete
decision problems
solving problems
neural network
np hard
computational cost
benchmark problems
polynomial hierarchy
database
databases
data mining
information retrieval
application domains
space complexity
problems involving
tractable cases