Search for tag: "b."

45 Media

11:02 Venn Diagram Paradox Venn Diagram Paradox	Venn Diagram Paradox The Venn Diagram Paradox from 3 Blue 1 Brown and minutesphysics full video at https://www.youtube.com/watch?v=zcqZHYo7ONs&t=843s photons filter percent photon filters b. circle questions degrees region experiments numbers experiment quantum c. answers sea half light wave From John Terning on June 20th, 2021 0 likes 4 plays 0
03:52 ECS 220 9a:1-8.6 IP=PSPACE (no proof) ECS 220 9a:1-8.6 IP=PSPACE (no proof)	ECS 220 9a:1-8.6 IP=PSPACE (no proof) space verifier bit prover strategy fee formula proof game power words bits class b. fact p. variant sort bpp quarter From David Doty on March 21st, 2021 0 likes 10 plays 0
09:51 ECS 220 7a:7.6-1 counter machine definition and… ECS 220 7a:7.6-1 counter machine definition and examples	ECS 220 7a:7.6-1 counter machine definition and examples counter loop machine times counters increment words decrement machines input lot definition d. b. function a. increments output shorthand test From David Doty on March 21st, 2021 0 likes 16 plays 0
07:59 ECS 220 5a:6.4-5 an oracle making P≠NP ECS 220 5a:6.4-5 an oracle making P≠NP	ECS 220 5a:6.4-5 an oracle making P≠NP string length probability oracle query strings queries b. fact lengths n. probabilistically infinity answer half input problem denominator times output From David Doty on March 21st, 2021 0 likes 13 plays 0
04:57 ECS 220 3c:5.5-2 CA-Predecessor ECS 220 3c:5.5-2 CA-Predecessor	ECS 220 3c:5.5-2 CA-Predecessor configuration trauma region problem function transition tiling ca tile predecessor b. eye age consistency orientation tiles idea problems garden input From David Doty on March 21st, 2021 0 likes 22 plays 0
11:09 ECS 220 2b:5.1 NP-completeness and reductions ECS 220 2b:5.1 NP-completeness and reductions	ECS 220 2b:5.1 NP-completeness and reductions problem np reduction problems instance input words b. reductions path graph verifier length urinary answer thing class lot 31st language From David Doty on March 21st, 2021 0 likes 41 plays 0
10:31 ECS 220 2a:4.2-2 k-SAT for k=1,2,3 ECS 220 2a:4.2-2 k-SAT for k=1,2,3	ECS 220 2a:4.2-2 k-SAT for k=1,2,3 clause clauses negation arrow literals formula cnf variables assignment variable p. loop graph sat reachability arrows cycle edges node b. From David Doty on March 21st, 2021 0 likes 29 plays 0
09:53 ECS 220 1a:2.1 problems and solutions ECS 220 1a:2.1 problems and solutions	ECS 220 1a:2.1 problems and solutions problem divisor algorithm graph decision mod b. function path gcd string graphs squares machines definition star language strings sense inputs From David Doty on March 21st, 2021 0 likes 45 plays 0
06:24 ECS 120 9c:1 comparing sizes of sets ECS 120 9c:1 comparing sizes of sets	ECS 120 9c:1 comparing sizes of sets cardinality sets function b. elements numbers subset definition notation 1800s technique arrow maps size sense cantor diagonalization problem mind functions From David Doty on March 20th, 2021 0 likes 59 plays 0
05:27 ECS 120 9a:2 reducibility ECS 120 9a:2 reducibility	ECS 120 9a:2 reducibility algorithm problem reduction reductions kind problems subroutine instance b. x. terrain proof completeness np examples answer times introduction y. equals From David Doty on March 20th, 2021 0 likes 75 plays 0
12:07 ECS 120 8c:3 definition of NP-completeness ECS 120 8c:3 definition of NP-completeness	ECS 120 8c:3 definition of NP-completeness np problem problems reduction thing reducible language b. theorem things x. input f. function corollary subset hypothesis idea reductions output From David Doty on March 20th, 2021 0 likes 73 plays 0
02:27 ECS 120 8b:4 how to remember which direction… ECS 120 8b:4 how to remember which direction reductions go	ECS 120 8b:4 how to remember which direction reductions go instance algorithm reduction thing b. function side problem a. hardness direction reductions relationship x. outputs input f. picture sense notation From David Doty on March 20th, 2021 0 likes 57 plays 0
06:53 ECS 120 8b:3 using reductions to bound hardness… ECS 120 8b:3 using reductions to bound hardness of problems	ECS 120 8b:3 using reductions to bound hardness of problems input length algorithm instance answer thing b. cubed contrapositive problems c. decider mb x. function nb proof a. reducible clique From David Doty on March 20th, 2021 0 likes 65 plays 0
11:52 ECS 120 8b:2 definition of polynomial-time… ECS 120 8b:2 definition of polynomial-time reducibility	ECS 120 8b:2 definition of polynomial-time reducibility Errata: starting at 8:30, I show Python code with the function reduction_from_clique_to_independent_set. This should be reduction_from_independent_set_to_clique instead. algorithm clique instance strings reduction b. input graph star problem idea answer a. output function compliment nodes pair requirement difficulty From David Doty on March 20th, 2021 0 likes 77 plays 0
04:28 ECS 120 8a:5 ranking the hardness of problems ECS 120 8a:5 ranking the hardness of problems	ECS 120 8a:5 ranking the hardness of problems algorithm problem a. cubed bit notion problems amount b. end reduction calls decision isms reducibility level zoom algorithms exponent equivalent From David Doty on March 20th, 2021 0 likes 71 plays 0
02:04 ECS 120 6c:5 definition of Ω(), ω(),… ECS 120 6c:5 definition of Ω(), ω(), and Θ()	ECS 120 6c:5 definition of Ω(), ω(), and Θ() g. theta f. functions omega n. function equals thing rates growth equivalence operators b. From David Doty on March 20th, 2021 1 likes 86 plays 0