Christopher Wilson

Christopher Wilson is an Associate Professor at the Department of Computer Science within the School of Computer and Data Sciences at the University of Oregon. His research focuses on computational complexity and parallel computation models, particularly the NC and AC hierarchies. He has been funded by the National Science Foundation (NSF) and holds degrees from the University of Oregon and the University of Toronto.

Education

• BS (1978) from the University of Oregon
• MS (1980) from the University of Toronto
• PhD (1984) from the University of Toronto

Research Interests

Wilson’s work addresses complexity classes derived from parallel computational models (NC and AC), relativized space-bounded computation, and the role of negation gates in Boolean circuits. He has explored structural properties of these hierarchies using decomposition techniques and nonrelativizing proof methods, drawing parallels to unresolved questions like P vs NP.

Recent Articles

His recent publications (1988–1991) examine polynomial-size circuits with limited negation, relativized space measures, and hierarchical decompositions of NC/AC classes. These studies highlight the theoretical limits of parallel speedup and the impact of hardware constraints on computational complexity.

Grants

Wilson has received funding from the National Science Foundation for his research into computational complexity.

Contact

Email: cwilson@uoregon.edu | Office: 326 Deschutes Hall, University of Oregon, Eugene OR 97403-1202 | Office Hours: Monday, Wednesday, Friday from 2:30-3:30pm