Login / Signup
Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets
Ravi Kannan
Published in:
Inf. Control. (1982)
Keyphrases
</>
lower bound
upper bound
objective function
running times
branch and bound
data sets
computational complexity
worst case
memory requirements
sparse coding
branch and bound algorithm
vc dimension
sparse data
compressive sensing