Old Web
English
Sign In
Acemap
>
Paper
>
Computational Complexity of Subclass Problems
Computational Complexity of Subclass Problems
1994
M. Kudo
M. Shimbo
Keywords:
Computational problem
Mathematical optimization
Computational resource
Complete
Structural complexity theory
Decision tree model
Dynamic problem
Mathematics
Asymptotic computational complexity
Average-case complexity
Theoretical computer science
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]