Search for tag: "log"

41 Media

01:10:06 ECS 289A Lecture 2b ECS 289A Lecture 2b	ECS 289A Lecture 2b tile shape tiles machine thing point turing computation points types sort bit assembly tape input log shapes tree subset string From David Doty on March 22nd, 2021 0 likes 1 plays 0
01:23:52 ECS 289A Lecture 1b ECS 289A Lecture 1b	ECS 289A Lecture 1b tile log types tiles bit square bits strength thing glues glue base row times blues n. goal complexity carry temperature From David Doty on March 22nd, 2021 0 likes 3 plays 0
15:53 ECS 220 9b:8.5 Immerman-Szelepcsényi… ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n)	ECS 220 9b:8.5 Immerman-Szelepcsényi Theorem NSPACE(s(n)) = coNSPACE(s(n)) for s(n) ≥ log(n) space nodes reachability path algorithm node error steps bit proof paths length end graph zeros pad linear log guesses step From David Doty on March 21st, 2021 0 likes 2 plays 0
09:03 ECS 220 8c:8.4 Savitch's theorem… ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm	ECS 220 8c:8.4 Savitch's theorem space-bounded deterministic simulation of space-bounded nondeterminism, space usage of Savitch_s algorithm space log algorithm path nodes length graph reachability recursion n. bits half memory point root levels level node call stack From David Doty on March 21st, 2021 0 likes 1 plays 0
05:46 ECS 220 8b:8.3-2 NL-WitnessExistence and… ECS 220 8b:8.3-2 NL-WitnessExistence and Reachability are NL-complete	ECS 220 8b:8.3-2 NL-WitnessExistence and Reachability are NL-complete log space input existence witness reachability reduction thing things configuration graph bits memory question urinary problem deterministically configurations element triple From David Doty on March 21st, 2021 0 likes 1 plays 0
05:39 ECS 220 8b:8.3-1 NL-completeness and logspace… ECS 220 8b:8.3-1 NL-completeness and logspace reductions	ECS 220 8b:8.3-1 NL-completeness and logspace reductions space log completeness reduction reductions output problem notion reachability edge input graph nodes tape np pair thing star lot problems From David Doty on March 21st, 2021 0 likes 1 plays 0
06:57 ECS 220 8b:8.2 Reachability ECS 220 8b:8.2 Reachability	ECS 220 8b:8.2 Reachability graph space reachability configuration nodes problem path machine log edges graphs size input memory node computation degree fact nondeterministic thing From David Doty on March 21st, 2021 0 likes 2 plays 0
06:12 ECS 220 8a:8.1-2 space-bounded complexity classes… ECS 220 8a:8.1-2 space-bounded complexity classes L and PSPACE	ECS 220 8a:8.1-2 space-bounded complexity classes L and PSPACE space log configuration bits memory orbit input problems symbol pointer pointers class n. classes complexity x. rules size ca rule From David Doty on March 21st, 2021 0 likes 1 plays 0
07:37 ECS 220 4c:6.3-3 simulation slowdown and the Time… ECS 220 4c:6.3-3 simulation slowdown and the Time Hierarchy Theorem	ECS 220 4c:6.3-3 simulation slowdown and the Time Hierarchy Theorem steps subset problems programming languages machines language simulation catch-22 linear step log interpreter slowdown polynomial exponent end bit amount theorem From David Doty on March 21st, 2021 0 likes 2 plays 0
14:14 ECS 220 4b:6.2 upper bounds versus lower bounds ECS 220 4b:6.2 upper bounds versus lower bounds	ECS 220 4b:6.2 upper bounds versus lower bounds algorithm log algorithms problem computation tree comparisons box n. element elements bounds formula leaves comparison bits bit length times array From David Doty on March 21st, 2021 0 likes 6 plays 0
04:04 ECS 220 3a:4-5.2 string representation of Turing… ECS 220 3a:4-5.2 string representation of Turing machine	ECS 220 3a:4-5.2 string representation of Turing machine tape machine head configuration position alphabet bits string turing cell strings representation binary circuit zeros symbols log blank content algorithm From David Doty on March 21st, 2021 0 likes 15 plays 0
06:03 ECS 220 1b:2.2-2 asymptotic notation ECS 220 1b:2.2-2 asymptotic notation	ECS 220 1b:2.2-2 asymptotic notation function base exponent equals functions notation n. log omega t. input algorithm theta cubed end d. bounds values size steps From David Doty on March 21st, 2021 0 likes 32 plays 0
06:22 ECS 120 9c:6 R vs. (0,1) ECS 120 9c:6 R vs. (0,1)	ECS 120 9c:6 R vs. (0,1) reals numbers interval unit cardinality base function x. log minus input fact cantor functions sets concept science pi power domain From David Doty on March 20th, 2021 0 likes 2 plays 0
06:23 ECS 120 7b:1 example problem in P - RelPrime ECS 120 7b:1 example problem in P - RelPrime	ECS 120 7b:1 example problem in P - RelPrime log algorithm base length numbers mod integers iterations y. string divisor problem remainder half loop distance iteration shortcut divisors egypt From David Doty on March 20th, 2021 0 likes 2 plays 0
09:04 ECS 120 7a:2 definition of P, encoding of data… ECS 120 7a:2 definition of P, encoding of data structures	ECS 120 7a:2 definition of P, encoding of data structures size bits elements encoding expansion bit adjacency graph length algorithm matrix string log strings encodings element factor binary notion class From David Doty on March 20th, 2021 0 likes 5 plays 0
11:26 ECS 120 6c:4 rules-of-thumb for comparing… ECS 120 6c:4 rules-of-thumb for comparing function growth rates	ECS 120 6c:4 rules-of-thumb for comparing function growth rates log times n. growth root rate power base equals exponent end running things lot polynomial constants place sides o. cubed From David Doty on March 20th, 2021 0 likes 1 plays 0