Login / Signup
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets.
Ricard Gavaldà
José L. Balcázar
Published in:
MFCS (1988)
Keyphrases
</>
computational complexity
real world
information retrieval
decision making
high level
video sequences
lower bound
special case
denoising
worst case