11:57

ECS 220 8c:8.6-1 Reachability expressed…

ECS 220 8c:8.6-1 Reachability expressed logically, and as a game between prover and skeptic

07:33

ECS 220 8a:8.1-3 relationship of time and…

ECS 220 8a:8.1-3 relationship of time and space-bounded complexity classes

04:10

ECS 220 2b:4.3-3 problems not obviously in NP

02:00

ECS 220 2b:4.3-2 NTIME(t(n))

09:56

ECS 120 8a:1 exponential-time algorithms for NP…

ECS 120 8a:1 exponential-time algorithms for NP problems

AggieVideo video portal by Academic Technology ServicesUC Davis | Information and Educational Technology | User Guides and Technical Documentation