1 #LyX 2.1 created this file. For more info see http://www.lyx.org/
7 \beamertemplateshadingbackground{red!5}{structure!5}
9 \usepackage{beamerthemeshadow}
10 \usepackage{pgfnodes,pgfarrows,pgfheaps}
12 \beamertemplatetransparentcovereddynamicmedium
15 \pgfdeclareimage[width=0.6cm]{icsi-logo}{beamer-icsi-logo}
16 \logo{\pgfuseimage{icsi-logo}}
21 \newcommand{\Class}[1]{\operatorname{\mathchoice
27 \newcommand{\Lang}[1]{\operatorname{\text{\textsc{#1}}}}
29 % This gets defined by beamerbasecolor.sty, but only at the beginning of
31 \colorlet{averagebackgroundcolor}{normal text.bg}
33 \newcommand{\tape}[3]{%
34 \color{structure!30!averagebackgroundcolor}
35 \pgfmoveto{\pgfxy(-0.5,0)}
36 \pgflineto{\pgfxy(-0.6,0.1)}
37 \pgflineto{\pgfxy(-0.4,0.2)}
38 \pgflineto{\pgfxy(-0.6,0.3)}
39 \pgflineto{\pgfxy(-0.4,0.4)}
40 \pgflineto{\pgfxy(-0.5,0.5)}
41 \pgflineto{\pgfxy(4,0.5)}
42 \pgflineto{\pgfxy(4.1,0.4)}
43 \pgflineto{\pgfxy(3.9,0.3)}
44 \pgflineto{\pgfxy(4.1,0.2)}
45 \pgflineto{\pgfxy(3.9,0.1)}
46 \pgflineto{\pgfxy(4,0)}
51 \pgfputat{\pgfxy(0,0.7)}{\pgfbox[left,base]{#1}}
52 \pgfputat{\pgfxy(0,-0.1)}{\pgfbox[left,top]{#2}}
55 \pgfputat{\pgfxy(-.1,0.25)}{\pgfbox[left,center]{\texttt{#3}}}%
58 \newcommand{\shorttape}[3]{%
59 \color{structure!30!averagebackgroundcolor}
60 \pgfmoveto{\pgfxy(-0.5,0)}
61 \pgflineto{\pgfxy(-0.6,0.1)}
62 \pgflineto{\pgfxy(-0.4,0.2)}
63 \pgflineto{\pgfxy(-0.6,0.3)}
64 \pgflineto{\pgfxy(-0.4,0.4)}
65 \pgflineto{\pgfxy(-0.5,0.5)}
66 \pgflineto{\pgfxy(1,0.5)}
67 \pgflineto{\pgfxy(1.1,0.4)}
68 \pgflineto{\pgfxy(0.9,0.3)}
69 \pgflineto{\pgfxy(1.1,0.2)}
70 \pgflineto{\pgfxy(0.9,0.1)}
71 \pgflineto{\pgfxy(1,0)}
76 \pgfputat{\pgfxy(0.25,0.7)}{\pgfbox[center,base]{#1}}
77 \pgfputat{\pgfxy(0.25,-0.1)}{\pgfbox[center,top]{#2}}
80 \pgfputat{\pgfxy(-.1,0.25)}{\pgfbox[left,center]{\texttt{#3}}}%
83 \pgfdeclareverticalshading{heap1}{\the\paperwidth}%
84 {color(0pt)=(black); color(1cm)=(structure!65!white)}
85 \pgfdeclareverticalshading{heap2}{\the\paperwidth}%
86 {color(0pt)=(black); color(1cm)=(structure!55!white)}
87 \pgfdeclareverticalshading{heap3}{\the\paperwidth}%
88 {color(0pt)=(black); color(1cm)=(structure!45!white)}
89 \pgfdeclareverticalshading{heap4}{\the\paperwidth}%
90 {color(0pt)=(black); color(1cm)=(structure!35!white)}
91 \pgfdeclareverticalshading{heap5}{\the\paperwidth}%
92 {color(0pt)=(black); color(1cm)=(structure!25!white)}
93 \pgfdeclareverticalshading{heap6}{\the\paperwidth}%
94 {color(0pt)=(black); color(1cm)=(red!35!white)}
96 \newcommand{\heap}[5]{%
99 \pgfheappath{\pgfxy(0,#1)}{\pgfxy(-#2,0)}{\pgfxy(#2,0)}
101 \begin{pgfmagnify}{1}{#1}
102 \pgfputat{\pgfpoint{-.5\paperwidth}{0pt}}{\pgfbox[left,base]{\pgfuseshading{heap#5}}}
108 \pgfheappath{\pgfxy(0,#1)}{\pgfxy(-#2,0)}{\pgfxy(#2,0)}
112 \pgfheaplabel{\pgfxy(0,#1)}{#3}%
116 \newcommand{\langat}[2]{%
117 \color{black!30!beamerexample}
118 \pgfsetlinewidth{0.6pt}
119 \pgfsetendarrow{\pgfarrowdot}
120 \pgfline{\pgfxy(-3.5,#1)}{\pgfxy(0.05,#1)}
121 \color{beamerexample}
122 \pgfputat{\pgfxy(-3.6,#1)}{\pgfbox[right,center]{#2}}%
125 \newcommand{\langatother}[2]{%
126 \color{black!30!beamerexample}
127 \pgfsetlinewidth{0.6pt}
128 \pgfsetendarrow{\pgfarrowdot}
129 \pgfline{\pgfxy(3.5,#1)}{\pgfxy(-0.05,#1)}
130 \color{beamerexample}
131 \pgfputat{\pgfxy(3.6,#1)}{\pgfbox[left,center]{#2}}%
135 \pgfdeclaremask{knight1-mask}{beamer-knight1-mask} \pgfdeclareimage[height=2cm,mask=knight1-mask]{knight1}{beamer-knight1} \pgfdeclaremask{knight2-mask}{beamer-knight2-mask} \pgfdeclareimage[height=2cm,mask=knight2-mask]{knight2}{beamer-knight2} \pgfdeclaremask{knight3-mask}{beamer-knight3-mask} \pgfdeclareimage[height=2cm,mask=knight3-mask,interpolate=true]{knight3}{beamer-knight3} \pgfdeclaremask{knight4-mask}{beamer-knight4-mask} \pgfdeclareimage[height=2cm,mask=knight4-mask,interpolate=true]{knight4}{beamer-knight4}
138 \pgfdeclareradialshading{graphnode}
139 {\pgfpoint{-3pt}{3.6pt}}%
140 {color(0cm)=(beamerexample!15);
141 color(2.63pt)=(beamerexample!75);
142 color(5.26pt)=(beamerexample!70!black);
143 color(7.6pt)=(beamerexample!50!black);
144 color(8pt)=(beamerexample!10!averagebackgroundcolor)}
146 \newcommand{\graphnode}[2]{
147 \pgfnodecircle{#1}[virtual]{#2}{8pt}
148 \pgfputat{#2}{\pgfbox[center,center]{\pgfuseshading{graphnode}}}
152 \use_default_options false
153 \maintain_unincluded_children false
155 \language_package default
160 \font_typewriter default
162 \font_default_family default
163 \use_non_tex_fonts false
169 \default_output_format default
171 \bibtex_command default
172 \index_command default
173 \paperfontsize default
178 \use_package amsmath 2
179 \use_package amssymb 2
181 \use_package mathdots 1
182 \use_package mathtools 0
183 \use_package mhchem 1
184 \use_package stmaryrd 0
185 \use_package undertilde 0
187 \cite_engine_type numerical
191 \paperorientation portrait
201 \paragraph_separation indent
202 \paragraph_indentation default
203 \quotes_language english
206 \paperpagestyle default
207 \tracking_changes false
208 \output_changes false
211 \html_be_strict false
218 \begin_inset Newline newline
221 Finding Paths in Tournaments
228 \begin_layout Institute
229 International Computer Science Institute
230 \begin_inset Newline newline
234 \begin_inset Argument 1
237 \begin_layout Plain Layout
250 \begin_layout BeginFrame
254 \begin_layout Standard
255 \begin_inset CommandInset toc
256 LatexCommand tableofcontents
264 \begin_layout Plain Layout
274 \begin_layout EndFrame
278 \begin_layout Standard
282 \begin_layout Plain Layout
284 % Show the table of contents at the beginning
287 \begin_layout Plain Layout
289 % of every subsection.
292 \begin_layout Plain Layout
296 AtBeginSubsection[]{%
299 \begin_layout Plain Layout
306 \begin_layout Plain Layout
313 \begin_layout Plain Layout
317 tableofcontents[current,currentsubsection]
320 \begin_layout Plain Layout
325 \begin_layout Plain Layout
335 \begin_layout Section
339 \begin_layout Subsection
340 What are Tournaments?
343 \begin_layout BeginFrame
344 Tournaments Consist of Jousts Between Knights
347 \begin_layout Columns
356 \begin_layout Standard
360 \begin_layout Plain Layout
364 begin{pgfpicture}{1.25cm}{-1cm}{7cm}{4cm}
367 \begin_layout Plain Layout
371 pgfnodebox{A}[virtual]{
376 \begin_layout Plain Layout
380 pgfuseimage{knight1}}{2pt}{2pt}
383 \begin_layout Plain Layout
387 pgfnodebox{B}[virtual]{
392 \begin_layout Plain Layout
396 pgfuseimage{knight2}}{2pt}{2pt}
399 \begin_layout Plain Layout
403 pgfnodebox{C}[virtual]{
408 \begin_layout Plain Layout
412 pgfuseimage{knight3}}{2pt}{2pt}
415 \begin_layout Plain Layout
419 pgfnodebox{D}[virtual]{
424 \begin_layout Plain Layout
428 pgfuseimage{knight4}}{2pt}{2pt}
431 \begin_layout Plain Layout
438 \begin_layout Plain Layout
449 \begin_layout Plain Layout
456 \begin_layout Plain Layout
460 pgfsetlinewidth{0.6pt}
463 \begin_layout Plain Layout
467 pgfnodeconnline{A}{B}
470 \begin_layout Plain Layout
474 pgfnodeconnline{A}{C}
477 \begin_layout Plain Layout
481 pgfnodeconnline{D}{A}
484 \begin_layout Plain Layout
488 pgfnodeconnline{C}{B}
491 \begin_layout Plain Layout
495 pgfnodeconnline{B}{D}
498 \begin_layout Plain Layout
502 pgfnodeconnline{C}{D}
505 \begin_layout Plain Layout
510 \begin_layout Plain Layout
527 \begin_inset Argument 2
530 \begin_layout Plain Layout
531 What is a Tournament?
540 \begin_layout Itemize
541 \begin_inset Argument item:2
544 \begin_layout Plain Layout
553 \begin_layout Itemize
554 \begin_inset Argument item:2
557 \begin_layout Plain Layout
563 Every pair has a joust.
566 \begin_layout Itemize
567 \begin_inset Argument item:2
570 \begin_layout Plain Layout
576 In every joust one knight wins.
581 \begin_layout BeginFrame
582 Tournaments are Complete Directed Graphs
585 \begin_layout Columns
594 \begin_layout Standard
598 \begin_layout Plain Layout
602 begin{pgfpicture}{1.5cm}{-1cm}{6.5cm}{4cm}
605 \begin_layout Plain Layout
612 \begin_layout Plain Layout
616 pgfsetlinewidth{0.6pt}
619 \begin_layout Plain Layout
628 \begin_layout Plain Layout
637 \begin_layout Plain Layout
646 \begin_layout Plain Layout
655 \begin_layout Plain Layout
662 \begin_layout Plain Layout
670 pgfbox[center,center]{$v_2$}}
673 \begin_layout Plain Layout
681 pgfbox[center,center]{$v_3$}}
684 \begin_layout Plain Layout
692 pgfbox[center,center]{$v_4$}}
695 \begin_layout Plain Layout
703 pgfbox[center,center]{$v_1$}}
706 \begin_layout Plain Layout
713 \begin_layout Plain Layout
722 \begin_layout Plain Layout
726 pgfnodesetsepstart{2pt}
729 \begin_layout Plain Layout
733 pgfnodesetsepend{4pt}
736 \begin_layout Plain Layout
740 pgfnodeconnline{A}{B}
743 \begin_layout Plain Layout
747 pgfnodeconnline{A}{C}
750 \begin_layout Plain Layout
754 pgfnodeconnline{D}{A}
757 \begin_layout Plain Layout
761 pgfnodeconnline{C}{B}
764 \begin_layout Plain Layout
768 pgfnodeconnline{B}{D}
771 \begin_layout Plain Layout
775 pgfnodeconnline{D}{C}
778 \begin_layout Plain Layout
794 \begin_layout Definition
795 \begin_inset Argument 1
798 \begin_layout Plain Layout
816 \begin_layout Enumerate
820 \begin_layout Enumerate
821 with exactly one edge between
822 \begin_inset Newline newline
825 any two different vertices.
830 \begin_layout BeginFrame
834 \begin_layout Plain Layout
841 Tournaments Arise Naturally in Different Situations
844 \begin_layout ExampleBlock
845 \begin_inset Argument 2
848 \begin_layout Plain Layout
849 Applications in Ordering Theory
858 \begin_layout Standard
859 Elements in a set need to be sorted.
861 \begin_inset Newline newline
864 The comparison relation may be cyclic, however.
868 \begin_layout Separator
872 \begin_layout ExampleBlock
873 \begin_inset Argument 2
876 \begin_layout Plain Layout
877 Applications in Sociology
886 \begin_layout Standard
887 Several candidates apply for a position.
888 \begin_inset Newline newline
891 Reviewers decide for any two candidates whom they prefer.
896 \begin_layout Separator
900 \begin_layout ExampleBlock
901 \begin_inset Argument 2
904 \begin_layout Plain Layout
905 Applications in Structural Complexity Theory
914 \begin_layout Standard
916 \begin_inset Formula $L$
919 is given and a selector function
920 \begin_inset Formula $f$
924 \begin_inset Newline newline
927 It chooses from any two words the one more likely to be in
928 \begin_inset Formula $f$
935 \begin_layout Subsection
936 What Does ``Finding Paths'' Mean?
939 \begin_layout BeginFrame
940 ``Finding Paths'' is Ambiguous
944 \begin_inset Argument 2
947 \begin_layout Plain Layout
949 \begin_inset Flex Only
952 \begin_layout Plain Layout
953 \begin_inset Argument 1
956 \begin_layout Plain Layout
962 Path Finding Problems
968 \begin_inset Flex Only
971 \begin_layout Plain Layout
972 \begin_inset Argument 1
975 \begin_layout Plain Layout
982 \begin_inset Formula $\Lang{reach}$
991 \begin_inset Flex Only
994 \begin_layout Plain Layout
995 \begin_inset Argument 1
998 \begin_layout Plain Layout
1004 the Construction Problem
1010 \begin_inset Flex Only
1013 \begin_layout Plain Layout
1014 \begin_inset Argument 1
1017 \begin_layout Plain Layout
1023 the Optimization Problem
1029 \begin_inset Flex Only
1032 \begin_layout Plain Layout
1033 \begin_inset Argument 1
1036 \begin_layout Plain Layout
1043 \begin_inset Formula $\Lang{distance}$
1052 \begin_inset Flex Only
1055 \begin_layout Plain Layout
1056 \begin_inset Argument 1
1059 \begin_layout Plain Layout
1065 the Approximation Problem
1079 \begin_layout Itemize
1089 \begin_inset Formula $G=(V,E)$
1101 \begin_inset Formula $s\in V$
1113 \begin_inset Formula $t\in V$
1119 \begin_layout Itemize
1120 \begin_inset Argument item:2
1123 \begin_layout Plain Layout
1136 \begin_inset space ~
1140 \begin_inset Formula $d$
1147 \begin_layout Plain Layout
1159 \begin_layout Itemize
1160 \begin_inset Argument item:2
1163 \begin_layout Plain Layout
1178 \begin_inset Formula $r>1$
1185 \begin_layout Standard
1189 \begin_layout Plain Layout
1201 \begin_layout Overprint
1202 \begin_inset Argument item:1
1205 \begin_layout Plain Layout
1215 \begin_layout Columns
1216 \begin_inset Argument 1
1219 \begin_layout Plain Layout
1229 \begin_layout Standard
1230 \begin_inset Flex Alternative
1233 \begin_layout Plain Layout
1234 \begin_inset Argument 1
1237 \begin_layout Plain Layout
1244 \begin_inset Argument 2
1247 \begin_layout Plain Layout
1251 \begin_layout Plain Layout
1271 \begin_layout Plain Layout
1288 \begin_layout ExampleBlock
1289 \begin_inset Argument 2
1292 \begin_layout Plain Layout
1302 \begin_layout Standard
1306 \begin_layout Plain Layout
1310 begin{pgfpicture}{2.5cm}{-0.6cm}{7.5cm}{2.6cm}
1313 \begin_layout Plain Layout
1317 \begin_layout Plain Layout
1321 color{beamerexample}
1324 \begin_layout Plain Layout
1328 \begin_layout Plain Layout
1332 pgfsetlinewidth{0.6pt}
1335 \begin_layout Plain Layout
1339 \begin_layout Plain Layout
1348 \begin_layout Plain Layout
1352 \begin_layout Plain Layout
1361 \begin_layout Plain Layout
1365 \begin_layout Plain Layout
1374 \begin_layout Plain Layout
1378 \begin_layout Plain Layout
1387 \begin_layout Plain Layout
1391 \begin_layout Plain Layout
1395 \begin_layout Plain Layout
1399 \begin_layout Plain Layout
1406 \begin_layout Plain Layout
1410 \begin_layout Plain Layout
1418 pgfbox[center,center]{$t$}}
1421 \begin_layout Plain Layout
1425 \begin_layout Plain Layout
1433 pgfbox[center,center]{$s$}}
1436 \begin_layout Plain Layout
1440 \begin_layout Plain Layout
1444 \begin_layout Plain Layout
1448 \begin_layout Plain Layout
1452 color{beamerexample}
1455 \begin_layout Plain Layout
1459 \begin_layout Plain Layout
1468 \begin_layout Plain Layout
1472 \begin_layout Plain Layout
1476 pgfnodesetsepstart{2pt}
1479 \begin_layout Plain Layout
1483 \begin_layout Plain Layout
1487 pgfnodesetsepend{4pt}
1490 \begin_layout Plain Layout
1494 \begin_layout Plain Layout
1498 pgfnodeconnline{A}{B}
1501 \begin_layout Plain Layout
1505 \begin_layout Plain Layout
1509 pgfnodeconnline{A}{C}
1512 \begin_layout Plain Layout
1516 \begin_layout Plain Layout
1520 pgfnodeconnline{D}{A}
1523 \begin_layout Plain Layout
1527 \begin_layout Plain Layout
1531 pgfnodeconnline{C}{B}
1534 \begin_layout Plain Layout
1538 \begin_layout Plain Layout
1542 pgfnodeconnline{B}{D}
1545 \begin_layout Plain Layout
1549 \begin_layout Plain Layout
1553 pgfnodeconnline{D}{C}
1556 \begin_layout Plain Layout
1560 \begin_layout Plain Layout
1564 \begin_layout Plain Layout
1568 \begin_layout Plain Layout
1578 pgfbox[left,center]{, $d=2$}}}
1581 \begin_layout Plain Layout
1585 \begin_layout Plain Layout
1595 pgfbox[left,center]{, $r=1.5$}}}
1598 \begin_layout Plain Layout
1602 \begin_layout Plain Layout
1612 pgfbox[left,center]{, $r=1.25$}}}
1615 \begin_layout Plain Layout
1619 \begin_layout Plain Layout
1632 \begin_layout Standard
1633 \begin_inset Flex Only
1636 \begin_layout Plain Layout
1637 \begin_inset Argument 1
1640 \begin_layout Plain Layout
1650 \begin_layout Plain Layout
1667 \begin_layout ExampleBlock
1668 \begin_inset Argument 1
1671 \begin_layout Plain Layout
1678 \begin_inset Argument 2
1681 \begin_layout Plain Layout
1691 \begin_layout Standard
1695 \begin_layout Plain Layout
1699 begin{pgfpicture}{2.5cm}{-0.6cm}{7.5cm}{2.6cm}
1702 \begin_layout Plain Layout
1709 \begin_layout Plain Layout
1713 color{beamerexample}
1716 \begin_layout Plain Layout
1720 pgfsetlinewidth{0.6pt}
1723 \begin_layout Plain Layout
1732 \begin_layout Plain Layout
1741 \begin_layout Plain Layout
1750 \begin_layout Plain Layout
1759 \begin_layout Plain Layout
1766 \begin_layout Plain Layout
1774 pgfbox[center,center]{$t$}}
1777 \begin_layout Plain Layout
1785 pgfbox[center,center]{$s$}}
1788 \begin_layout Plain Layout
1792 color{beamerexample}
1795 \begin_layout Plain Layout
1804 \begin_layout Plain Layout
1808 pgfnodesetsepstart{2pt}
1811 \begin_layout Plain Layout
1815 pgfnodesetsepend{4pt}
1818 \begin_layout Plain Layout
1824 pgfnodeconnline{A}{B}}
1827 \begin_layout Plain Layout
1833 pgfnodeconnline{A}{C}}
1836 \begin_layout Plain Layout
1842 pgfnodeconnline{D}{A}}
1845 \begin_layout Plain Layout
1851 pgfnodeconnline{C}{B}}
1854 \begin_layout Plain Layout
1858 pgfnodeconnline{B}{D}
1861 \begin_layout Plain Layout
1865 pgfnodeconnline{D}{C}
1868 \begin_layout Plain Layout
1873 \begin_layout Plain Layout
1883 pgfbox[left,center]{
1888 \begin_layout Plain Layout
1903 \begin_layout Overprint
1904 \begin_inset Argument item:1
1907 \begin_layout Plain Layout
1918 \begin_inset Argument 2
1921 \begin_layout Plain Layout
1922 Variants of Path Finding Problems
1931 \begin_layout Description
1932 \begin_inset Argument item:1
1935 \begin_layout Plain Layout
1942 \begin_inset space ~
1945 Problem: Is there a path from
1946 \begin_inset Formula $s$
1950 \begin_inset space ~
1954 \begin_inset Formula $t$
1958 \begin_inset Argument 2
1961 \begin_layout Plain Layout
1962 Approximation Problem:
1970 \begin_layout Description
1971 \begin_inset Argument item:1
1974 \begin_layout Plain Layout
1981 \begin_inset space ~
1984 Problem: Construct a path from
1985 \begin_inset Formula $s$
1989 \begin_inset space ~
1993 \begin_inset Formula $t$
1999 \begin_layout Description
2000 \begin_inset Argument item:1
2003 \begin_layout Plain Layout
2010 \begin_inset space ~
2013 Problem: Construct a shortest path from
2014 \begin_inset Formula $s$
2018 \begin_inset space ~
2022 \begin_inset Formula $t$
2028 \begin_layout Description
2029 \begin_inset Argument item:1
2032 \begin_layout Plain Layout
2039 \begin_inset space ~
2042 Problem: Is the distance of
2043 \begin_inset Formula $s$
2047 \begin_inset space ~
2051 \begin_inset Formula $t$
2055 \begin_inset space ~
2059 \begin_inset Formula $d$
2065 \begin_layout Description
2066 \begin_inset Argument item:1
2069 \begin_layout Plain Layout
2076 \begin_inset space ~
2079 Problem: Construct a path from
2080 \begin_inset Formula $s$
2084 \begin_inset space ~
2088 \begin_inset Formula $t$
2092 \begin_inset Newline newline
2095 approximately their distance.
2100 \begin_layout Section
2104 \begin_layout Subsection
2105 Standard Complexity Classes
2108 \begin_layout Standard
2112 \begin_layout Plain Layout
2116 pgfdeclaremask{computer-mask}{beamer-g4-mask}
2118 pgfdeclareimage[height=2cm,mask=computer-mask,interpolate=true]{computer}{beamer
2127 \begin_layout BeginFrame
2128 The Classes L and NL are Defined via
2129 \begin_inset Newline newline
2132 Logspace Turing Machines
2135 \begin_layout Standard
2139 \begin_layout Plain Layout
2143 begin{pgfpicture}{-0.5cm}{0cm}{8cm}{5cm}
2146 \begin_layout Plain Layout
2155 \begin_layout Plain Layout
2159 tape{input tape (read only), $n$ symbols}{}{3401234*3143223=}}
2162 \begin_layout Plain Layout
2169 \begin_layout Plain Layout
2178 \begin_layout Plain Layout
2182 tape{}{output tape (write only)}{10690836937182}}
2185 \begin_layout Plain Layout
2190 \begin_layout Plain Layout
2197 \begin_layout Plain Layout
2206 \begin_layout Plain Layout
2210 shorttape{work tape (read/write), $O(
2212 log n)$ symbols}{}{42}}
2215 \begin_layout Plain Layout
2224 \begin_layout Plain Layout
2228 pgfbox[center,center]{
2230 pgfuseimage{computer}}}
2233 \begin_layout Plain Layout
2238 \begin_layout Plain Layout
2242 pgfsetlinewidth{0.6pt}
2245 \begin_layout Plain Layout
2252 \begin_layout Plain Layout
2261 \begin_layout Plain Layout
2265 pgfxycurve(1.75,3.5)(1.75,3.75)(0,3.5)(0,3.85)
2268 \begin_layout Plain Layout
2274 pgfxycurve(1.75,1.5)(1.75,1)(0,1.5)(0,1.05)}
2277 \begin_layout Plain Layout
2283 pgfxycurve(2.65,2.5)(3.75,2.5)(7,1)(7,1.9)}
2286 \begin_layout Plain Layout
2298 \begin_layout BeginFrame
2299 Logspace Turing Machines Are Quite Powerful
2303 \begin_inset Argument 2
2306 \begin_layout Plain Layout
2307 Deterministic logspace machines can compute
2316 \begin_layout Itemize
2317 addition, multiplication, and even division
2320 \begin_layout Itemize
2321 reductions used in completeness proofs,
2324 \begin_layout Itemize
2325 reachability in forests.
2334 \begin_inset Argument 2
2337 \begin_layout Plain Layout
2338 Non-deterministic logspace machines can compute
2347 \begin_layout Itemize
2348 reachability in graphs,
2351 \begin_layout Itemize
2352 non-reachability in graphs,
2355 \begin_layout Itemize
2356 satisfiability with two literals per clause.
2360 \begin_layout BeginFrame
2364 \begin_layout Plain Layout
2366 <1>[label=hierarchy]
2371 The Complexity Class Hierarchy
2374 \begin_layout Standard
2378 \begin_layout Plain Layout
2382 begin{pgfpicture}{-5.4cm}{0cm}{5.4cm}{5.5cm}
2385 \begin_layout Plain Layout
2389 pgfsetlinewidth{0.8pt}
2392 \begin_layout Plain Layout
2401 \begin_layout Plain Layout
2405 pgfsetdash{{2pt}}{0pt}
2408 \begin_layout Plain Layout
2416 Class{NC}^2$}{black!50!structure}{2}}
2419 \begin_layout Plain Layout
2425 Class{NL}$}{black!50!structure}{3}
2428 \begin_layout Plain Layout
2434 Class{L}$}{black!50!structure}{4}
2437 \begin_layout Plain Layout
2448 \begin_layout Plain Layout
2454 Class{NC}^1}$}{black!50!structure}{5}
2457 \begin_layout Plain Layout
2462 \begin_layout Plain Layout
2469 \begin_layout Plain Layout
2480 \begin_layout Plain Layout
2486 Class{AC}^0}$}{black}{6}
2489 \begin_layout Plain Layout
2494 \begin_layout Plain Layout
2498 pgfsetlinewidth{1.0pt}
2501 \begin_layout Plain Layout
2508 \begin_layout Plain Layout
2512 pgfxyline(-5,0)(5,0)
2515 \begin_layout Plain Layout
2526 \begin_layout Plain Layout
2536 operatorname{forest}}$}}
2539 \begin_layout Plain Layout
2550 \begin_layout Plain Layout
2569 \begin_layout Plain Layout
2588 \begin_layout Plain Layout
2601 \begin_layout Plain Layout
2609 operatorname{forest}}$,}
2614 \begin_layout Plain Layout
2622 operatorname{forest}}$,}
2627 \begin_layout Plain Layout
2635 operatorname{path}}$,}
2640 \begin_layout Plain Layout
2648 operatorname{path}}$}}}
2651 \begin_layout Plain Layout
2656 \begin_layout Plain Layout
2666 operatorname{tourn}}$}}
2669 \begin_layout Plain Layout
2682 \begin_layout Plain Layout
2690 operatorname{tourn}}$,}
2695 \begin_layout Plain Layout
2706 \begin_layout Plain Layout
2715 \begin_layout Plain Layout
2720 \begin_layout Plain Layout
2726 pgfsetdash{{1pt}}{0pt}%
2729 \begin_layout Plain Layout
2737 operatorname{tourn}}$''}
2740 \begin_layout Plain Layout
2745 \begin_layout Plain Layout
2757 \begin_layout BeginFrame
2758 The Circuit Complexity Classes AC
2759 \begin_inset Formula $^{0}$
2763 \begin_inset Formula $^{1}$
2767 \begin_inset Formula $^{2}$
2771 \begin_inset Newline newline
2774 Limit the Circuit Depth
2777 \begin_layout Standard
2781 \begin_layout Plain Layout
2790 \begin_layout Plain Layout
2802 \begin_layout Columns
2803 \begin_inset Argument 1
2806 \begin_layout Plain Layout
2816 \begin_layout Column
2821 \begin_inset Argument 2
2824 \begin_layout Plain Layout
2826 \begin_inset Formula $\Class{AC}^{0}$
2838 \begin_layout Itemize
2839 \begin_inset Formula $O(1)$
2845 \begin_layout Itemize
2850 \begin_layout Examples
2855 \begin_layout Itemize
2856 \begin_inset Formula $\Lang{addition}\in\Class{AC}^{0}$
2862 \begin_layout Itemize
2863 \begin_inset Formula $\Lang{parity}\notin\Class{AC}^{0}$
2874 \begin_layout Column
2879 \begin_inset Argument 2
2882 \begin_layout Plain Layout
2884 \begin_inset Formula $\Class{NC}^{1}$
2896 \begin_layout Itemize
2897 \begin_inset Formula $O(\log n)$
2903 \begin_layout Itemize
2908 \begin_layout Examples
2913 \begin_layout Itemize
2914 \begin_inset Formula $\Lang{parity}\in\Class{NC}^{1}$
2920 \begin_layout Itemize
2921 \begin_inset Formula $\Lang{mutiply}\in\Class{NC}^{1}$
2927 \begin_layout Itemize
2928 \begin_inset Formula $\Lang{divide}\in\Class{NC}^{1}$
2939 \begin_layout Column
2944 \begin_inset Argument 2
2947 \begin_layout Plain Layout
2949 \begin_inset Formula $\Class{NC}^{2}$
2961 \begin_layout Itemize
2962 \begin_inset Formula $O(\log^{2}n)$
2968 \begin_layout Itemize
2973 \begin_layout Examples
2978 \begin_layout Itemize
2979 \begin_inset Formula $\Class{NL}\subseteq\Class{NC}^{2}$
2987 \begin_layout AgainFrame
2988 \begin_inset Argument 1
2991 \begin_layout Plain Layout
3000 \begin_layout Subsection
3001 Standard Complexity Results on Finding Paths
3004 \begin_layout BeginFrame
3005 All Variants of Finding Paths in Directed Graphs
3006 \begin_inset Newline newline
3009 Are Equally Difficult
3013 \begin_inset Formula $\Lang{reach}$
3017 \begin_inset Formula $\Lang{distance}$
3021 \begin_inset Formula $\Class{NL}$
3032 \begin_layout Corollary
3033 For directed graphs, we can solve
3037 \begin_layout Itemize
3038 the reachability problem in logspace iff
3039 \begin_inset Formula $\Class{L}=\Class{NL}$
3045 \begin_layout Itemize
3046 the construction problem in logspace iff
3047 \begin_inset Formula $\Class{L}=\Class{NL}$
3053 \begin_layout Itemize
3054 the optimization problem in logspace iff
3055 \begin_inset Formula $\Class{L}=\Class{NL}$
3061 \begin_layout Itemize
3062 the approximation problem in logspace iff
3063 \begin_inset Formula $\Class{L}=\Class{NL}$
3070 \begin_layout AgainFrame
3071 \begin_inset Argument 1
3074 \begin_layout Plain Layout
3083 \begin_layout BeginFrame
3084 Finding Paths in Forests and Directed Paths is Easy,
3085 \begin_inset Newline newline
3092 \begin_inset Formula $\Lang{reach}_{\operatorname{forest}}$
3096 \begin_inset Formula $\Lang{distance}_{\operatorname{forest}}$
3100 \begin_inset Formula $\Class{L}$
3106 \begin_layout Separator
3111 \begin_inset Formula $\Lang{reach}_{\operatorname{path}}$
3115 \begin_inset Formula $\Lang{distance}_{\operatorname{path}}$
3119 \begin_inset Formula $\Class{L}$
3125 \begin_layout AgainFrame
3126 \begin_inset Argument 1
3129 \begin_layout Plain Layout
3138 \begin_layout Section
3139 Finding Paths in Tournaments
3142 \begin_layout Subsection
3143 Complexity of: Does a Path Exist?
3146 \begin_layout BeginFrame
3147 Definition of the Tournament Reachability Problem
3150 \begin_layout Definition
3156 \begin_inset Formula $\Lang{reach}_{\operatorname{tourn}}$
3164 \begin_inset Formula $(T,s,t)$
3171 \begin_layout Enumerate
3172 \begin_inset Formula $T=(V,E)$
3178 \begin_layout Enumerate
3179 there exists a path from
3180 \begin_inset space ~
3184 \begin_inset Formula $s$
3188 \begin_inset space ~
3192 \begin_inset Formula $t$
3199 \begin_layout BeginFrame
3200 The Tournament Reachability Problem is Very Easy
3203 \begin_layout Theorem
3204 \begin_inset Formula $\Lang{reach}_{\operatorname{tourn}}\in\Class{AC}^{0}$
3214 \begin_layout AlertBlock
3215 \begin_inset Argument 2
3218 \begin_layout Plain Layout
3228 \begin_layout Itemize
3230 \begin_inset Quotes eld
3234 \begin_inset Quotes erd
3238 \begin_inset Formula $\Lang{reach}$
3242 \begin_inset Formula $\Lang{reach}_{\operatorname{path}}$
3248 \begin_layout Itemize
3249 \begin_inset Formula $\Lang{reach}\not\le_{\operatorname{m}}^{\Class{AC}^{0}}\Lang{reach}_{\operatorname{tourn}}$
3256 \begin_layout AgainFrame
3257 \begin_inset Argument 1
3260 \begin_layout Plain Layout
3269 \begin_layout Subsection
3270 Complexity of: Construct a Shortest Path
3273 \begin_layout BeginFrame
3274 Finding a Shortest Path Is as Difficult as
3275 \begin_inset Newline newline
3278 the Distance Problem
3281 \begin_layout Definition
3287 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3295 \begin_inset Formula $(T,s,t,d)$
3302 \begin_layout Enumerate
3303 \begin_inset Formula $T=(V,E)$
3306 is a tournament in which
3309 \begin_layout Enumerate
3311 \begin_inset Formula $s$
3315 \begin_inset space ~
3319 \begin_inset Formula $t$
3323 \begin_inset space ~
3327 \begin_inset Formula $d$
3334 \begin_layout BeginFrame
3335 The Tournament Distance Problem is Hard
3338 \begin_layout Theorem
3339 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3343 \begin_inset Formula $\Class{NL}$
3349 \begin_layout Standard
3350 \begin_inset space \hfill{}
3357 \begin_layout Plain Layout
3361 hyperlink{hierarchy<6>}{
3363 beamerskipbutton{Skip Proof}}
3375 \begin_layout Corollary
3376 Shortest path in tournaments can be constructed
3377 \begin_inset Newline newline
3380 in logarithmic space, iff
3381 \begin_inset Formula $\Class{L}=\Class{NL}$
3391 \begin_layout Corollary
3392 \begin_inset Formula $\Lang{distance}\le_{\operatorname{m}}^{\Class{AC}^{0}}\Lang{distance}_{\operatorname{tourn}}$
3398 \begin_layout BeginFrame
3400 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3406 \begin_layout Standard
3410 \begin_layout Plain Layout
3422 \begin_layout Columns
3423 \begin_inset Argument 1
3426 \begin_layout Plain Layout
3436 \begin_layout Column
3440 \begin_layout Standard
3444 \begin_layout Plain Layout
3459 \begin_inset Argument 2
3462 \begin_layout Plain Layout
3464 \begin_inset Formula $\Lang{reach}$
3468 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3480 \begin_layout Enumerate
3481 \begin_inset Argument item:2
3484 \begin_layout Plain Layout
3491 \begin_inset Formula $(G,s,t)$
3495 \begin_inset Formula $\Lang{reach}$
3501 \begin_layout Enumerate
3502 \begin_inset Argument item:2
3505 \begin_layout Plain Layout
3512 \begin_inset Formula $G$
3516 \begin_inset Formula $G'$
3522 \begin_layout Enumerate
3523 \begin_inset Argument item:2
3526 \begin_layout Plain Layout
3533 \begin_inset Newline newline
3537 \begin_inset Formula $(G',s',t',3)\in\Lang{distance}_{\operatorname{tourn}}$
3544 \begin_layout Separator
3549 \begin_inset Argument 2
3552 \begin_layout Plain Layout
3559 \begin_inset Argument 1
3562 \begin_layout Plain Layout
3572 \begin_layout Enumerate
3573 \begin_inset Argument item:2
3576 \begin_layout Plain Layout
3583 \begin_inset space ~
3587 \begin_inset Formula $G$
3591 \begin_inset Newline newline
3595 \begin_inset space ~
3599 \begin_inset Formula $G'$
3605 \begin_layout Enumerate
3606 \begin_inset Argument item:2
3609 \begin_layout Plain Layout
3616 \begin_inset space ~
3620 \begin_inset Formula $G'$
3624 \begin_inset Newline newline
3628 \begin_inset space ~
3632 \begin_inset Formula $G'$
3639 \begin_layout Column
3643 \begin_layout Example
3647 \begin_layout Plain Layout
3651 begin{pgfpicture}{0cm}{-1.25cm}{4.5cm}{3.75cm}
3654 \begin_layout Plain Layout
3658 color{beamerexample}
3661 \begin_layout Plain Layout
3665 pgfsetlinewidth{0.6pt}
3668 \begin_layout Plain Layout
3677 \begin_layout Plain Layout
3686 \begin_layout Plain Layout
3695 \begin_layout Plain Layout
3704 \begin_layout Plain Layout
3711 \begin_layout Plain Layout
3719 pgfbox[center,center]{$s$}}
3722 \begin_layout Plain Layout
3730 pgfbox[center,center]{$t$}}
3733 \begin_layout Plain Layout
3737 color{beamerexample}
3740 \begin_layout Plain Layout
3749 \begin_layout Plain Layout
3753 pgfnodesetsepstart{2pt}
3756 \begin_layout Plain Layout
3760 pgfnodesetsepend{2pt}
3763 \begin_layout Plain Layout
3769 pgfnodeconnline{B}{A}}
3772 \begin_layout Plain Layout
3778 pgfnodeconnline{B}{C}}
3781 \begin_layout Plain Layout
3787 pgfnodeconnline{C}{D}}
3790 \begin_layout Plain Layout
3796 pgfnodeconncurve{A}{C}{45}{135}{15pt}{15pt}}
3799 \begin_layout Plain Layout
3807 pgfbox[left,center]{$G
3812 \begin_layout Plain Layout
3819 \begin_layout Plain Layout
3827 pgfbox[left,center]{$G'
3832 \begin_layout Plain Layout
3841 \begin_layout Plain Layout
3850 \begin_layout Plain Layout
3859 \begin_layout Plain Layout
3868 \begin_layout Plain Layout
3877 \begin_layout Plain Layout
3886 \begin_layout Plain Layout
3895 \begin_layout Plain Layout
3904 \begin_layout Plain Layout
3913 \begin_layout Plain Layout
3922 \begin_layout Plain Layout
3931 \begin_layout Plain Layout
3940 \begin_layout Plain Layout
3949 \begin_layout Plain Layout
3958 \begin_layout Plain Layout
3967 \begin_layout Plain Layout
3976 \begin_layout Plain Layout
3983 \begin_layout Plain Layout
3991 pgfbox[center,center]{$s'$}}
3994 \begin_layout Plain Layout
4002 pgfbox[center,center]{$t'$}}
4005 \begin_layout Plain Layout
4010 \begin_layout Plain Layout
4015 \begin_layout Plain Layout
4022 \begin_layout Plain Layout
4026 pgfsetlinewidth{0.4pt}
4029 \begin_layout Plain Layout
4033 color{beamerexample!25!averagebackgroundcolor}
4036 \begin_layout Plain Layout
4040 pgfnodeconnline{A2}{C1}
4043 \begin_layout Plain Layout
4047 pgfnodeconnline{A2}{D1}
4050 \begin_layout Plain Layout
4054 pgfnodeconnline{B2}{A1}
4057 \begin_layout Plain Layout
4061 pgfnodeconnline{B2}{C1}
4064 \begin_layout Plain Layout
4068 pgfnodeconnline{B2}{D1}
4071 \begin_layout Plain Layout
4075 pgfnodeconnline{C2}{D1}
4078 \begin_layout Plain Layout
4082 pgfnodeconnline{D2}{A1}
4085 \begin_layout Plain Layout
4089 pgfnodeconnline{D2}{B1}
4092 \begin_layout Plain Layout
4096 pgfnodeconnline{A3}{C2}
4099 \begin_layout Plain Layout
4103 pgfnodeconnline{A3}{D2}
4106 \begin_layout Plain Layout
4110 pgfnodeconnline{B3}{A2}
4113 \begin_layout Plain Layout
4117 pgfnodeconnline{B3}{C2}
4120 \begin_layout Plain Layout
4124 pgfnodeconnline{B3}{D2}
4127 \begin_layout Plain Layout
4131 pgfnodeconnline{C3}{D2}
4134 \begin_layout Plain Layout
4138 pgfnodeconnline{D3}{A2}
4141 \begin_layout Plain Layout
4145 pgfnodeconnline{D3}{B2}
4148 \begin_layout Plain Layout
4152 pgfnodeconnline{A4}{C3}
4155 \begin_layout Plain Layout
4159 pgfnodeconnline{A4}{D3}
4162 \begin_layout Plain Layout
4166 pgfnodeconnline{B4}{A3}
4169 \begin_layout Plain Layout
4173 pgfnodeconnline{B4}{C3}
4176 \begin_layout Plain Layout
4180 pgfnodeconnline{B4}{D3}
4183 \begin_layout Plain Layout
4187 pgfnodeconnline{C4}{D3}
4190 \begin_layout Plain Layout
4194 pgfnodeconnline{D4}{A3}
4197 \begin_layout Plain Layout
4201 pgfnodeconnline{D4}{B3}
4204 \begin_layout Plain Layout
4213 \begin_layout Plain Layout
4217 pgfnodeconnline{A1}{B1}
4220 \begin_layout Plain Layout
4224 pgfnodeconnline{B1}{C1}
4227 \begin_layout Plain Layout
4231 pgfnodeconnline{C1}{D1}
4234 \begin_layout Plain Layout
4238 pgfnodeconnline{A2}{B2}
4241 \begin_layout Plain Layout
4245 pgfnodeconnline{B2}{C2}
4248 \begin_layout Plain Layout
4252 pgfnodeconnline{C2}{D2}
4255 \begin_layout Plain Layout
4259 pgfnodeconnline{A3}{B3}
4262 \begin_layout Plain Layout
4266 pgfnodeconnline{B3}{C3}
4269 \begin_layout Plain Layout
4273 pgfnodeconnline{C3}{D3}
4276 \begin_layout Plain Layout
4280 pgfnodeconnline{A4}{B4}
4283 \begin_layout Plain Layout
4287 pgfnodeconnline{B4}{C4}
4290 \begin_layout Plain Layout
4294 pgfnodeconnline{C4}{D4}
4297 \begin_layout Plain Layout
4304 \begin_layout Plain Layout
4308 pgfnodeconncurve{A3}{A1}{135}{-135}{10pt}{10pt}
4311 \begin_layout Plain Layout
4315 pgfnodeconncurve{A4}{A2}{135}{-135}{10pt}{10pt}
4318 \begin_layout Plain Layout
4322 pgfnodeconncurve{A4}{A1}{135}{-135}{15pt}{15pt}
4325 \begin_layout Plain Layout
4329 pgfnodeconncurve{B3}{B1}{135}{-135}{10pt}{10pt}
4332 \begin_layout Plain Layout
4336 pgfnodeconncurve{B4}{B2}{135}{-135}{10pt}{10pt}
4339 \begin_layout Plain Layout
4343 pgfnodeconncurve{B4}{B1}{135}{-135}{15pt}{15pt}
4346 \begin_layout Plain Layout
4350 pgfnodeconncurve{C3}{C1}{135}{-135}{10pt}{10pt}
4353 \begin_layout Plain Layout
4357 pgfnodeconncurve{C4}{C2}{135}{-135}{10pt}{10pt}
4360 \begin_layout Plain Layout
4364 pgfnodeconncurve{C4}{C1}{135}{-135}{15pt}{15pt}
4367 \begin_layout Plain Layout
4371 pgfnodeconncurve{D3}{D1}{135}{-135}{10pt}{10pt}
4374 \begin_layout Plain Layout
4378 pgfnodeconncurve{D4}{D2}{135}{-135}{10pt}{10pt}
4381 \begin_layout Plain Layout
4385 pgfnodeconncurve{D4}{D1}{135}{-135}{15pt}{15pt}
4388 \begin_layout Plain Layout
4392 color{beamerexample}
4395 \begin_layout Plain Layout
4399 pgfsetlinewidth{0.6pt}
4402 \begin_layout Plain Layout
4407 \begin_layout Plain Layout
4414 \begin_layout Plain Layout
4421 \begin_layout Plain Layout
4425 pgfnodeconnline{B1}{A2}
4428 \begin_layout Plain Layout
4432 pgfnodeconnline{B2}{A3}
4435 \begin_layout Plain Layout
4439 pgfnodeconnline{B3}{A4}
4442 \begin_layout Plain Layout
4447 \begin_layout Plain Layout
4454 \begin_layout Plain Layout
4461 \begin_layout Plain Layout
4465 pgfnodeconnline{B1}{C2}
4468 \begin_layout Plain Layout
4472 pgfnodeconnline{B2}{C3}
4475 \begin_layout Plain Layout
4479 pgfnodeconnline{B3}{C4}
4482 \begin_layout Plain Layout
4487 \begin_layout Plain Layout
4494 \begin_layout Plain Layout
4501 \begin_layout Plain Layout
4505 pgfnodeconnline{C1}{D2}
4508 \begin_layout Plain Layout
4514 pgfnodeconnline{C2}{D3}}
4517 \begin_layout Plain Layout
4523 pgfnodeconnline{C3}{D4}}
4526 \begin_layout Plain Layout
4531 \begin_layout Plain Layout
4538 \begin_layout Plain Layout
4545 \begin_layout Plain Layout
4551 pgfnodeconnline{A1}{C2}}
4554 \begin_layout Plain Layout
4560 pgfnodeconnline{A2}{C3}}
4563 \begin_layout Plain Layout
4567 pgfnodeconnline{A3}{C4}
4570 \begin_layout Plain Layout
4575 \begin_layout Plain Layout
4582 \begin_layout Plain Layout
4589 \begin_layout Plain Layout
4595 pgfnodeconnline{A1}{A2}}
4598 \begin_layout Plain Layout
4602 pgfnodeconnline{A2}{A3}
4605 \begin_layout Plain Layout
4609 pgfnodeconnline{A3}{A4}
4612 \begin_layout Plain Layout
4616 pgfnodeconnline{B1}{B2}
4619 \begin_layout Plain Layout
4623 pgfnodeconnline{B2}{B3}
4626 \begin_layout Plain Layout
4630 pgfnodeconnline{B3}{B4}
4633 \begin_layout Plain Layout
4637 pgfnodeconnline{C1}{C2}
4640 \begin_layout Plain Layout
4644 pgfnodeconnline{C2}{C3}
4647 \begin_layout Plain Layout
4651 pgfnodeconnline{C3}{C4}
4654 \begin_layout Plain Layout
4658 pgfnodeconnline{D1}{D2}
4661 \begin_layout Plain Layout
4665 pgfnodeconnline{D2}{D3}
4668 \begin_layout Plain Layout
4674 pgfnodeconnline{D3}{D4}}
4677 \begin_layout Plain Layout
4682 \begin_layout Plain Layout
4695 \begin_layout AgainFrame
4696 \begin_inset Argument 1
4699 \begin_layout Plain Layout
4708 \begin_layout Subsection
4709 Complexity of: Approximating the Shortest Path
4712 \begin_layout BeginFrame
4713 Approximators Compute Paths that Are Nearly As Short As a Shortest Path
4716 \begin_layout Definition
4721 approximation scheme for
4722 \begin_inset Formula $\Lang{tournament-shortest-path}$
4733 \begin_layout Enumerate
4735 \begin_inset Formula $(T,s,t)\in\Lang{reach}_{\operatorname{tourn}}$
4741 \begin_layout Enumerate
4743 \begin_inset Formula $r>1$
4749 \begin_layout Standard
4753 \begin_layout Itemize
4755 \begin_inset Formula $s$
4759 \begin_inset space ~
4763 \begin_inset Formula $t$
4767 \begin_inset Formula $r\operatorname{d_{T}}(s,t)$
4774 \begin_layout BeginFrame
4775 There Exists a Logspace Approximation Scheme for
4776 \begin_inset Newline newline
4779 the Tournament Shortest Path Problem
4782 \begin_layout Theorem
4783 There exists an approximation scheme for
4784 \begin_inset Formula $\Lang{tournament-shortest-path}$
4788 \begin_inset Formula $1<r<2$
4792 \begin_inset Formula
4794 O\left(\log|V|\log\frac{1}{r-1}\right).
4806 \begin_layout Corollary
4807 In tournaments, paths can be constructed in logarithmic space.
4810 \begin_layout Standard
4811 \begin_inset space \hfill{}
4818 \begin_layout Plain Layout
4822 hyperlink{optimality}{
4824 beamergotobutton{More Details}}
4832 \begin_layout AgainFrame
4833 \begin_inset Argument 1
4836 \begin_layout Plain Layout
4845 \begin_layout EndFrame
4849 \begin_layout Standard
4850 \begin_inset Note Note
4853 \begin_layout Plain Layout
4854 If a frame includes a program listing, the frame needs to be marked as
4855 \begin_inset Quotes eld
4859 \begin_inset Quotes erd
4863 This is not yet supported by LyX, so the frame is created using TeX code.
4866 begin{frame}[fragile] needs to be preceeded by an
4878 \begin_layout Standard
4882 \begin_layout Plain Layout
4886 begin{frame}[fragile]
4894 \begin_layout Standard
4898 \begin_layout Plain Layout
4907 Just a frame with a program code listing
4911 \begin_layout Plain Layout
4921 \begin_layout Standard
4922 This is some program code:
4925 \begin_layout Standard
4926 \begin_inset listings
4927 lstparams "extendedchars=true,language=Python,numbers=left,stepnumber=3,tabsize=4"
4931 \begin_layout Plain Layout
4936 \begin_layout Plain Layout
4938 'this is a python function'
4941 \begin_layout Plain Layout
4946 \begin_layout Plain Layout
4951 \begin_layout Plain Layout
4953 'This is a German word: Tschüs'
4956 \begin_layout Plain Layout
4961 \begin_layout Plain Layout
4966 \begin_layout Plain Layout
4968 'this is a python function'
4971 \begin_layout Plain Layout
4981 \begin_layout Standard
4985 \begin_layout Plain Layout
4997 \begin_layout Section*
5001 \begin_layout Subsection*
5005 \begin_layout BeginFrame
5010 \begin_inset Argument 2
5013 \begin_layout Plain Layout
5023 \begin_layout Itemize
5037 \begin_inset Formula $\Class{AC}^{0}$
5046 \begin_layout Itemize
5051 logspace approximation scheme
5063 shortest paths in tournaments.
5066 \begin_layout Itemize
5080 \begin_inset Formula $\Class{NL}$
5089 \begin_layout Separator
5094 \begin_inset Argument 2
5097 \begin_layout Plain Layout
5107 \begin_layout Itemize
5108 The same results apply to graphs with
5109 \begin_inset Newline newline
5112 bounded independence number.
5113 \begin_inset space \hfill{}
5120 \begin_layout Plain Layout
5124 hyperlink{independence}{
5126 beamergotobutton{More Details}}
5134 \begin_layout Itemize
5135 The complexity of finding paths in undirected graphs
5136 \begin_inset Newline newline
5140 \begin_inset space \hfill{}
5147 \begin_layout Plain Layout
5151 hyperlink{undirected}{
5153 beamergotobutton{More Details}}
5162 \begin_layout Subsection*
5166 \begin_layout BeginFrame
5170 \begin_layout Standard
5174 \begin_layout Plain Layout
5178 beamertemplatebookbibitems
5186 \begin_layout Bibliography
5187 \labelwidthstring References
5188 \begin_inset CommandInset bibitem
5189 LatexCommand bibitem
5195 \begin_inset space ~
5203 \begin_layout Plain Layout
5214 Topics on Tournaments.
5221 \begin_layout Plain Layout
5230 Holt, Rinehart, and Winston, 1968.
5235 \begin_layout Plain Layout
5239 beamertemplatearticlebibitems
5247 \begin_layout Bibliography
5248 \labelwidthstring References
5249 \begin_inset CommandInset bibitem
5250 LatexCommand bibitem
5251 key "NickelsenT2002"
5256 \begin_inset space ~
5259 Arfst Nickelsen and Till Tantau.
5264 \begin_layout Plain Layout
5273 On reachability in graphs with bounded independence number.
5277 \begin_layout Plain Layout
5291 , Springer-Verlag, 2002.
5294 \begin_layout Bibliography
5295 \labelwidthstring References
5296 \begin_inset CommandInset bibitem
5297 LatexCommand bibitem
5303 \begin_inset space ~
5310 \begin_layout Plain Layout
5319 A logspace approximation scheme for the shortest path problem for graphs
5320 with bounded independence number.
5324 \begin_layout Plain Layout
5338 , Springer-Verlag, 2004.
5343 \begin_layout Plain Layout
5355 \begin_layout EndFrame
5359 \begin_layout Standard
5364 \begin_layout Plain Layout
5368 AtBeginSubsection[]{}
5376 \begin_layout Section
5380 \begin_layout Subsection
5381 Graphs With Bounded Independence Number
5384 \begin_layout BeginFrame
5388 \begin_layout Plain Layout
5390 [label=independence]
5395 Definition of Independence Number of a Graph
5398 \begin_layout Definition
5408 \begin_inset Formula $\alpha(G)$
5412 \begin_inset Newline newline
5415 is the maximum number of vertices we can pick,
5416 \begin_inset Newline newline
5419 such that there is no edge between them.
5422 \begin_layout Example
5423 Tournaments have independence number 1.
5427 \begin_layout BeginFrame
5428 The Results for Tournaments also Apply to
5429 \begin_inset Newline newline
5432 Graphs With Bounded Independence Number
5435 \begin_layout Theorem
5437 \begin_inset space ~
5441 \begin_inset Formula $k$
5452 in graphs with independence number
5453 \begin_inset Newline newline
5457 \begin_inset space ~
5461 \begin_inset Formula $k$
5465 \begin_inset Formula $\Class{AC}^{0}$
5471 \begin_layout Separator
5475 \begin_layout Theorem
5477 \begin_inset space ~
5481 \begin_inset Formula $k$
5488 logspace approximation scheme
5492 for approximating the shortest path in graphs with independence number at
5494 \begin_inset space ~
5498 \begin_inset Formula $k$
5504 \begin_layout Separator
5508 \begin_layout Theorem
5510 \begin_inset space ~
5514 \begin_inset Formula $k$
5525 in graphs with independence number at most
5526 \begin_inset space ~
5530 \begin_inset Formula $k$
5538 \begin_inset Formula $\Class{NL}$
5546 \begin_layout Subsection
5547 Finding Paths in Undirected Graphs
5550 \begin_layout BeginFrame
5554 \begin_layout Plain Layout
5556 <1-2>[label=undirected]
5561 The Complexity of Finding Paths in Undirected Graphs
5562 \begin_inset Newline newline
5569 \begin_inset Formula $\Lang{reach}_{\operatorname{undirected}}$
5573 \begin_inset Formula $\Class{SL}$
5579 \begin_layout Corollary
5580 For undirected graphs, we can solve
5584 \begin_layout Itemize
5585 the reachability problem in logspace iff
5586 \begin_inset Formula $\Class L=\Class{SL}$
5592 \begin_layout Itemize
5593 the construction problem in logspace iff
5594 \begin_inset Flex Alternative
5597 \begin_layout Plain Layout
5598 \begin_inset Argument 1
5601 \begin_layout Plain Layout
5608 \begin_inset Argument 2
5611 \begin_layout Plain Layout
5618 \begin_inset Flex Alert
5621 \begin_layout Plain Layout
5622 \begin_inset Formula $\Class L=\Class{SL}$
5638 \begin_layout Itemize
5639 the optimization problem in logspace iff
5640 \begin_inset Flex Alternative
5643 \begin_layout Plain Layout
5644 \begin_inset Argument 1
5647 \begin_layout Plain Layout
5654 \begin_inset Argument 2
5657 \begin_layout Plain Layout
5664 \begin_inset Flex Alert
5667 \begin_layout Plain Layout
5668 \begin_inset Formula $\Class L=\Class{NL}$
5684 \begin_layout Itemize
5685 the approximation problem in logspace iff ?.
5690 \begin_layout Subsection
5691 The Approximation Scheme is Optimal
5694 \begin_layout BeginFrame
5698 \begin_layout Plain Layout
5705 The Approximation Scheme is Optimal
5708 \begin_layout Theorem
5709 Suppose there exists an approximation scheme for
5710 \begin_inset Formula $\Lang{tournament-shortest-path}$
5714 \begin_inset Formula $O\bigl(\log|V|\log^{1-\epsilon}\frac{1}{r-1}\bigr)$
5719 \begin_inset Formula $\Class{NL}\subseteq\Class{DSPACE}\bigl[\log^{2-\epsilon}n\bigr]$
5730 \begin_layout Enumerate
5731 Suppose the approximation scheme exists.
5732 \begin_inset Newline newline
5736 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}\in\Class{DSPACE}\bigl[\log^{2-\epsilon}n\bigr]$
5743 \begin_layout Enumerate
5745 \begin_inset Formula $(T,s,t)$
5750 \begin_inset Formula $n$
5753 be the number of vertices.
5756 \begin_layout Enumerate
5757 Run the approximation scheme for
5758 \begin_inset Formula $r:=1+\smash{\frac{1}{n+1}}$
5762 \begin_inset Newline newline
5766 \begin_inset Formula $\smash{O(\log^{2-\epsilon}n)}$
5772 \begin_layout Enumerate
5773 The resulting path has optimal length.
5778 \begin_layout Plain Layout
5791 \begin_layout EndFrame