Search for tag: "n."

ECS20 - W22 - Lecture 12 (6R): Induction and Recursion 1

Lecture 2022-02-10. The language of number theory, and the Peano axioms for it. The last axiom: the principle of mathematical induction. Different forms of it. Using induction for establishing…

From  Phil Rogaway 0 likes 136 plays 0  

mat133-2021-05-21-american-options

American options. mat133-2021-notes-2021-05-21.pdf Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons…

From  Matthias Koeppe 0 likes 55 plays 0  

ECS 120 0:7 combinatorics (discrete math review)

From  David Doty 1 likes 311 plays 0  

ECS 289A Lecture 1b

From  David Doty 0 likes 53 plays 0  

ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm

From  David Doty 0 likes 36 plays 0  

ECS 220 8a:8.1-2 space-bounded complexity classes L and PSPACE

From  David Doty 0 likes 42 plays 0  

ECS 220 5a:6.4-5 an oracle making P≠NP

From  David Doty 0 likes 27 plays 0  

ECS 220 5a:6.4-3 relativizing proofs

From  David Doty 0 likes 41 plays 0  

ECS 220 4b:6.2 upper bounds versus lower bounds

From  David Doty 0 likes 40 plays 0  

ECS 220 4b:6.1-1 time constructible functions

From  David Doty 0 likes 37 plays 0  

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

From  David Doty 0 likes 36 plays 0  

ECS 220 2b:4.3-1 formal definition of NP and NP in EXP

From  David Doty 0 likes 70 plays 0  

ECS 220 1b:2.2-2 asymptotic notation

From  David Doty 0 likes 59 plays 0  

ECS 220 1b:2.2-1 time complexity of GCD, factoring

From  David Doty 0 likes 154 plays 0  

ECS 120 7b:5 polynomial-time verifier for Composites

From  David Doty 1 likes 249 plays 0  

ECS 120 7a:1 time complexity classes and the Time Hierarchy Theorem

From  David Doty 1 likes 366 plays 0