C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Theory of Periodically Specified Problems: Complexity and Approximability.
Madhav V. Marathe
Harry B. Hunt III
Daniel J. Rosenkrantz
Richard Edwin Stearns
Published in:
Computational Complexity Conference (1998)
Keyphrases
</>
theoretical basis
application domains
average case complexity
related problems
problems involving
space complexity
decision problems
optimization problems
theoretical framework
description logics
benchmark problems
worst case
lower bound
decision trees
feature selection
general theory
database