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…

+24 More
From  Phil Rogaway 0 likes 139 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…

+19 More
From  Matthias Koeppe 0 likes 58 plays 0  

ECS 120 0:7 combinatorics (discrete math review)

+19 More
From  David Doty 1 likes 362 plays 0  

ECS 289A Lecture 1b

+19 More
From  David Doty 0 likes 59 plays 0  

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

+19 More
From  David Doty 0 likes 39 plays 0  

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

+19 More
From  David Doty 0 likes 43 plays 0  

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

+19 More
From  David Doty 0 likes 29 plays 0  

ECS 220 5a:6.4-3 relativizing proofs

+19 More
From  David Doty 0 likes 42 plays 0  

ECS 220 4b:6.2 upper bounds versus lower bounds

+19 More
From  David Doty 0 likes 41 plays 0  

ECS 220 4b:6.1-1 time constructible functions

+19 More
From  David Doty 0 likes 41 plays 0  

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

+19 More
From  David Doty 0 likes 39 plays 0  

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

+19 More
From  David Doty 0 likes 77 plays 0  

ECS 220 1b:2.2-2 asymptotic notation

+19 More
From  David Doty 0 likes 65 plays 0  

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

+19 More
From  David Doty 0 likes 223 plays 0  

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

+19 More
From  David Doty 1 likes 325 plays 0  

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

+19 More
From  David Doty 1 likes 459 plays 0