Go to Main Content

Online Access to BannerWeb - PNTR



Catalog Entries


Fall 2020
Oct 22, 2021
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.

CSCI 0401 - Computational Complexity
*Computational Complexity* We will study models of computation and investigate whether a model of computation can solve a given problem efficiently or not. We will consider models that involve all-knowing provers, constrained space, communication limitations, randomness, and quantum resources, among others. While not all of these models are realistic, by studying them, we will gain insight into why certain classes of problems are easy or difficult to solve. Students enrolled in the College Writing (CW) section of the course will explore these ideas through writing, in particular, in three contexts that are critical for theoretical computer science: the proof (expert audience), a review paper (non-expert computer science audience), and a popular science article (educated public audience). (CSCI 0301 and CSCI 0302, or instructor approval).3 hrs. sem./1 hr. disc. Hyflex: in-person participation will be on a rotating schedule, as there is a limited daily capacity.
0.000 OR 1.000 Credit hours
0.000 OR 1.000 Lecture hours
0.000 TO 2.000 Other hours

Levels: Undergraduate
Schedule Types: Discussion, Seminar

Natural Sciences Division
Computer Science Department

Course Attributes:

Return to Previous New Search XML Extract
Transparent Image
Skip to top of page