|
Theory Research
We are a research group within the
Department of Computer Science and Engineering at the University of California at San Diego.
Complexity Theory and Algorithms
The goal of complexity theory is to understand the
inherent
difficulty of
computational problems. It addresses the following question: are the
algorithms
currently used to solve computational problems the most efficient
possible or
can they be improved? Complexity theory manifests itself in many areas
of
computer science from faster hardware design to computer security. It
is used
both to formalize and verify obsevations from experimental computer
science and
extrapolate the effects of future technologies.
NP-Completeness
Randomness
Logic in Computer Science
|