Login / Signup
The Density and Complexity of Polynomial Cores for Intractable Sets.
Pekka Orponen
Uwe Schöning
Published in:
Inf. Control. (1986)
Keyphrases
</>
computational complexity
polynomial hierarchy
vapnik chervonenkis dimension
neural network
machine learning
space complexity
exponential size
database
databases
decision trees
computational cost
parallel processing
polynomial size
fixed parameter tractable