Login / Signup
Into the Square - On the Complexity of Quadratic-Time Solvable Problems.
Michele Borassi
Pierluigi Crescenzi
Michel Habib
Published in:
CoRR (2014)
Keyphrases
</>
computational complexity
decision problems
np hard
optimization problems
pairwise
np complete
np hardness
information systems
benchmark problems
polynomial hierarchy
real time
solving problems
problems involving
objective function
genetic algorithm
information retrieval
databases