1 #LyX 1.4.3 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 \newcommand{\tape}[3]{%
30 \color{structure!30!averagebackgroundcolor}
31 \pgfmoveto{\pgfxy(-0.5,0)}
32 \pgflineto{\pgfxy(-0.6,0.1)}
33 \pgflineto{\pgfxy(-0.4,0.2)}
34 \pgflineto{\pgfxy(-0.6,0.3)}
35 \pgflineto{\pgfxy(-0.4,0.4)}
36 \pgflineto{\pgfxy(-0.5,0.5)}
37 \pgflineto{\pgfxy(4,0.5)}
38 \pgflineto{\pgfxy(4.1,0.4)}
39 \pgflineto{\pgfxy(3.9,0.3)}
40 \pgflineto{\pgfxy(4.1,0.2)}
41 \pgflineto{\pgfxy(3.9,0.1)}
42 \pgflineto{\pgfxy(4,0)}
47 \pgfputat{\pgfxy(0,0.7)}{\pgfbox[left,base]{#1}}
48 \pgfputat{\pgfxy(0,-0.1)}{\pgfbox[left,top]{#2}}
51 \pgfputat{\pgfxy(-.1,0.25)}{\pgfbox[left,center]{\texttt{#3}}}%
54 \newcommand{\shorttape}[3]{%
55 \color{structure!30!averagebackgroundcolor}
56 \pgfmoveto{\pgfxy(-0.5,0)}
57 \pgflineto{\pgfxy(-0.6,0.1)}
58 \pgflineto{\pgfxy(-0.4,0.2)}
59 \pgflineto{\pgfxy(-0.6,0.3)}
60 \pgflineto{\pgfxy(-0.4,0.4)}
61 \pgflineto{\pgfxy(-0.5,0.5)}
62 \pgflineto{\pgfxy(1,0.5)}
63 \pgflineto{\pgfxy(1.1,0.4)}
64 \pgflineto{\pgfxy(0.9,0.3)}
65 \pgflineto{\pgfxy(1.1,0.2)}
66 \pgflineto{\pgfxy(0.9,0.1)}
67 \pgflineto{\pgfxy(1,0)}
72 \pgfputat{\pgfxy(0.25,0.7)}{\pgfbox[center,base]{#1}}
73 \pgfputat{\pgfxy(0.25,-0.1)}{\pgfbox[center,top]{#2}}
76 \pgfputat{\pgfxy(-.1,0.25)}{\pgfbox[left,center]{\texttt{#3}}}%
79 \pgfdeclareverticalshading{heap1}{\the\paperwidth}%
80 {color(0pt)=(black); color(1cm)=(structure!65!white)}
81 \pgfdeclareverticalshading{heap2}{\the\paperwidth}%
82 {color(0pt)=(black); color(1cm)=(structure!55!white)}
83 \pgfdeclareverticalshading{heap3}{\the\paperwidth}%
84 {color(0pt)=(black); color(1cm)=(structure!45!white)}
85 \pgfdeclareverticalshading{heap4}{\the\paperwidth}%
86 {color(0pt)=(black); color(1cm)=(structure!35!white)}
87 \pgfdeclareverticalshading{heap5}{\the\paperwidth}%
88 {color(0pt)=(black); color(1cm)=(structure!25!white)}
89 \pgfdeclareverticalshading{heap6}{\the\paperwidth}%
90 {color(0pt)=(black); color(1cm)=(red!35!white)}
92 \newcommand{\heap}[5]{%
95 \pgfheappath{\pgfxy(0,#1)}{\pgfxy(-#2,0)}{\pgfxy(#2,0)}
97 \begin{pgfmagnify}{1}{#1}
98 \pgfputat{\pgfpoint{-.5\paperwidth}{0pt}}{\pgfbox[left,base]{\pgfuseshading{heap#5}}}
104 \pgfheappath{\pgfxy(0,#1)}{\pgfxy(-#2,0)}{\pgfxy(#2,0)}
108 \pgfheaplabel{\pgfxy(0,#1)}{#3}%
112 \newcommand{\langat}[2]{%
113 \color{black!30!beamerexample}
114 \pgfsetlinewidth{0.6pt}
115 \pgfsetendarrow{\pgfarrowdot}
116 \pgfline{\pgfxy(-3.5,#1)}{\pgfxy(0.05,#1)}
117 \color{beamerexample}
118 \pgfputat{\pgfxy(-3.6,#1)}{\pgfbox[right,center]{#2}}%
121 \newcommand{\langatother}[2]{%
122 \color{black!30!beamerexample}
123 \pgfsetlinewidth{0.6pt}
124 \pgfsetendarrow{\pgfarrowdot}
125 \pgfline{\pgfxy(3.5,#1)}{\pgfxy(-0.05,#1)}
126 \color{beamerexample}
127 \pgfputat{\pgfxy(3.6,#1)}{\pgfbox[left,center]{#2}}%
131 \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}
134 \pgfdeclareradialshading{graphnode}
135 {\pgfpoint{-3pt}{3.6pt}}%
136 {color(0cm)=(beamerexample!15);
137 color(2.63pt)=(beamerexample!75);
138 color(5.26pt)=(beamerexample!70!black);
139 color(7.6pt)=(beamerexample!50!black);
140 color(8pt)=(beamerexample!10!averagebackgroundcolor)}
142 \newcommand{\graphnode}[2]{
143 \pgfnodecircle{#1}[virtual]{#2}{8pt}
144 \pgfputat{#2}{\pgfbox[center,center]{\pgfuseshading{graphnode}}}
152 \paperfontsize default
159 \paperorientation portrait
162 \paragraph_separation indent
164 \quotes_language english
167 \paperpagestyle default
168 \tracking_changes false
177 Finding Paths in Tournaments
184 \begin_layout Institute
185 International Computer Schience Institute
191 \begin_layout Standard
204 \begin_layout BeginFrame
208 \begin_layout Standard
209 \begin_inset LatexCommand \tableofcontents{}
217 \begin_layout Standard
227 \begin_layout EndFrame
231 \begin_layout Standard
235 \begin_layout Standard
237 % Show the table of contents at the beginning
240 \begin_layout Standard
244 \begin_layout Standard
246 % of every subsection.
249 \begin_layout Standard
253 \begin_layout Standard
260 \begin_layout Standard
264 \begin_layout Standard
271 \begin_layout Standard
275 \begin_layout Standard
282 \begin_layout Standard
286 \begin_layout Standard
290 tableofcontents[current,currentsubsection]
293 \begin_layout Standard
297 \begin_layout Standard
302 \begin_layout Standard
306 \begin_layout Standard
316 \begin_layout Section
320 \begin_layout Subsection
321 What are Tournaments?
324 \begin_layout BeginFrame
325 Tournaments Consist of Jousts Between Knights
328 \begin_layout Columns
337 \begin_layout Standard
341 \begin_layout Standard
345 begin{pgfpicture}{1.25cm}{-1cm}{7cm}{4cm}
348 \begin_layout Standard
352 \begin_layout Standard
356 pgfnodebox{A}[virtual]{
360 pgfuseimage{knight1}}{2pt}{2pt}
363 \begin_layout Standard
367 \begin_layout Standard
371 pgfnodebox{B}[virtual]{
375 pgfuseimage{knight2}}{2pt}{2pt}
378 \begin_layout Standard
382 \begin_layout Standard
386 pgfnodebox{C}[virtual]{
390 pgfuseimage{knight3}}{2pt}{2pt}
393 \begin_layout Standard
397 \begin_layout Standard
401 pgfnodebox{D}[virtual]{
405 pgfuseimage{knight4}}{2pt}{2pt}
408 \begin_layout Standard
412 \begin_layout Standard
416 \begin_layout Standard
420 \begin_layout Standard
427 \begin_layout Standard
431 \begin_layout Standard
442 \begin_layout Standard
446 \begin_layout Standard
453 \begin_layout Standard
457 \begin_layout Standard
461 pgfsetlinewidth{0.6pt}
464 \begin_layout Standard
468 \begin_layout Standard
472 pgfnodeconnline{A}{B}
475 \begin_layout Standard
479 \begin_layout Standard
483 pgfnodeconnline{A}{C}
486 \begin_layout Standard
490 \begin_layout Standard
494 pgfnodeconnline{D}{A}
497 \begin_layout Standard
501 \begin_layout Standard
505 pgfnodeconnline{C}{B}
508 \begin_layout Standard
512 \begin_layout Standard
516 pgfnodeconnline{B}{D}
519 \begin_layout Standard
523 \begin_layout Standard
527 pgfnodeconnline{C}{D}}
530 \begin_layout Standard
534 \begin_layout Standard
554 \begin_layout Standard
556 {What is a Tournament?}
565 \begin_layout Itemize
569 \begin_layout Standard
579 \begin_layout Itemize
583 \begin_layout Standard
590 Every pair has a joust.
593 \begin_layout Itemize
597 \begin_layout Standard
604 In every joust one knight wins.
609 \begin_layout BeginFrame
610 Tournaments are Complete Directed Graphs
613 \begin_layout Columns
622 \begin_layout Standard
626 \begin_layout Standard
630 begin{pgfpicture}{1.5cm}{-1cm}{6.5cm}{4cm}
633 \begin_layout Standard
637 \begin_layout Standard
644 \begin_layout Standard
648 \begin_layout Standard
652 pgfsetlinewidth{0.6pt}
655 \begin_layout Standard
659 \begin_layout Standard
668 \begin_layout Standard
672 \begin_layout Standard
681 \begin_layout Standard
685 \begin_layout Standard
694 \begin_layout Standard
698 \begin_layout Standard
707 \begin_layout Standard
711 \begin_layout Standard
715 \begin_layout Standard
719 \begin_layout Standard
726 \begin_layout Standard
730 \begin_layout Standard
738 pgfbox[center,center]{$v_2$}}
741 \begin_layout Standard
745 \begin_layout Standard
753 pgfbox[center,center]{$v_3$}}
756 \begin_layout Standard
760 \begin_layout Standard
768 pgfbox[center,center]{$v_4$}}
771 \begin_layout Standard
775 \begin_layout Standard
783 pgfbox[center,center]{$v_1$}}
786 \begin_layout Standard
790 \begin_layout Standard
794 \begin_layout Standard
798 \begin_layout Standard
805 \begin_layout Standard
809 \begin_layout Standard
818 \begin_layout Standard
822 \begin_layout Standard
826 pgfnodesetsepstart{2pt}
829 \begin_layout Standard
833 \begin_layout Standard
837 pgfnodesetsepend{4pt}
840 \begin_layout Standard
844 \begin_layout Standard
848 pgfnodeconnline{A}{B}
851 \begin_layout Standard
855 \begin_layout Standard
859 pgfnodeconnline{A}{C}
862 \begin_layout Standard
866 \begin_layout Standard
870 pgfnodeconnline{D}{A}
873 \begin_layout Standard
877 \begin_layout Standard
881 pgfnodeconnline{C}{B}
884 \begin_layout Standard
888 \begin_layout Standard
892 pgfnodeconnline{B}{D}
895 \begin_layout Standard
899 \begin_layout Standard
903 pgfnodeconnline{D}{C}
906 \begin_layout Standard
910 \begin_layout Standard
926 \begin_layout Definition
930 \begin_layout Standard
945 \begin_layout Enumerate
949 \begin_layout Enumerate
950 with exactly one edge between
952 any two different vertices.
957 \begin_layout BeginFrame
961 \begin_layout Standard
968 Tournaments Arise Naturally in Different Situations
971 \begin_layout ExampleBlock
975 \begin_layout Standard
977 {Applicatins in Ordering Theory}
986 \begin_layout Standard
987 Elements in a set need to be sorted.
990 The comparison relation may be cyclic, however.
994 \begin_layout Separator
998 \begin_layout ExampleBlock
1002 \begin_layout Standard
1004 {Applications in Sociology}
1013 \begin_layout Standard
1014 Several candidates apply for a position.
1016 Reviewers decide for any two candidates
1022 \begin_layout Separator
1026 \begin_layout ExampleBlock
1030 \begin_layout Standard
1032 {Applications in Structural Complexity Theory}
1041 \begin_layout Standard
1043 \begin_inset Formula $L$
1046 is given and a selector function
1047 \begin_inset Formula $f$
1052 It chooses from any two words the one more likely to be in
1053 \begin_inset Formula $f$
1060 \begin_layout Subsection
1061 What Does ``Finding Paths'' Mean?
1064 \begin_layout BeginFrame
1065 ``Finding Paths'' is Ambiguous
1072 \begin_layout Standard
1082 par{}% because LyX inserts superfluous paragraphs
1085 \begin_layout Standard
1089 \begin_layout Standard
1093 only<1>{Path Finding Problems}
1098 \begin_layout Standard
1102 \begin_layout Standard
1113 \begin_layout Standard
1117 \begin_layout Standard
1121 only<4-5>{the Construction Problem}
1126 \begin_layout Standard
1130 \begin_layout Standard
1134 only<6-7>{the Optimization Problem}
1139 \begin_layout Standard
1143 \begin_layout Standard
1154 \begin_layout Standard
1158 \begin_layout Standard
1162 only<10->{the Approximation Problem}}
1171 \begin_layout Itemize
1177 \begin_inset Formula $G=(V,E)$
1185 \begin_inset Formula $s\in V$
1193 \begin_inset Formula $t\in V$
1199 \begin_layout Itemize
1203 \begin_layout Standard
1205 <only@-9| visible@8->
1216 \begin_inset Formula $d$
1223 \begin_layout Standard
1235 \begin_layout Itemize
1239 \begin_layout Standard
1251 \begin_inset Formula $r>1$
1258 \begin_layout Standard
1262 \begin_layout Standard
1274 \begin_layout Overprint
1279 \begin_layout Standard
1283 \begin_layout Standard
1287 onslide<1,3,5,7,9,11-12>
1295 \begin_layout Columns
1299 \begin_layout Standard
1310 \begin_layout Standard
1314 \begin_layout Standard
1332 \begin_layout ExampleBlock
1336 \begin_layout Standard
1347 \begin_layout Standard
1351 \begin_layout Standard
1355 begin{pgfpicture}{2.5cm}{-0.6cm}{7.5cm}{2.6cm}
1358 \begin_layout Standard
1362 \begin_layout Standard
1366 color{beamerexample}
1369 \begin_layout Standard
1373 \begin_layout Standard
1377 pgfsetlinewidth{0.6pt}
1380 \begin_layout Standard
1384 \begin_layout Standard
1393 \begin_layout Standard
1397 \begin_layout Standard
1406 \begin_layout Standard
1410 \begin_layout Standard
1419 \begin_layout Standard
1423 \begin_layout Standard
1432 \begin_layout Standard
1436 \begin_layout Standard
1440 \begin_layout Standard
1444 \begin_layout Standard
1451 \begin_layout Standard
1455 \begin_layout Standard
1463 pgfbox[center,center]{$t$}}
1466 \begin_layout Standard
1470 \begin_layout Standard
1478 pgfbox[center,center]{$s$}}
1481 \begin_layout Standard
1485 \begin_layout Standard
1489 \begin_layout Standard
1493 \begin_layout Standard
1497 color{beamerexample}
1500 \begin_layout Standard
1504 \begin_layout Standard
1513 \begin_layout Standard
1517 \begin_layout Standard
1521 pgfnodesetsepstart{2pt}
1524 \begin_layout Standard
1528 \begin_layout Standard
1532 pgfnodesetsepend{4pt}
1535 \begin_layout Standard
1539 \begin_layout Standard
1543 pgfnodeconnline{A}{B}
1546 \begin_layout Standard
1550 \begin_layout Standard
1554 pgfnodeconnline{A}{C}
1557 \begin_layout Standard
1561 \begin_layout Standard
1565 pgfnodeconnline{D}{A}
1568 \begin_layout Standard
1572 \begin_layout Standard
1576 pgfnodeconnline{C}{B}
1579 \begin_layout Standard
1583 \begin_layout Standard
1587 pgfnodeconnline{B}{D}
1590 \begin_layout Standard
1594 \begin_layout Standard
1598 pgfnodeconnline{D}{C}
1601 \begin_layout Standard
1605 \begin_layout Standard
1609 \begin_layout Standard
1613 \begin_layout Standard
1623 pgfbox[left,center]{, $d=2$}}}
1626 \begin_layout Standard
1630 \begin_layout Standard
1640 pgfbox[left,center]{, $r=1.5$}}}
1643 \begin_layout Standard
1647 \begin_layout Standard
1657 pgfbox[left,center]{, $r=1.25$}}}
1660 \begin_layout Standard
1664 \begin_layout Standard
1677 \begin_layout Standard
1681 \begin_layout Standard
1695 \begin_layout ExampleBlock
1699 \begin_layout Standard
1701 <only@3->{Example Output}
1710 \begin_layout Standard
1714 \begin_layout Standard
1718 begin{pgfpicture}{2.5cm}{-0.6cm}{7.5cm}{2.6cm}
1721 \begin_layout Standard
1725 \begin_layout Standard
1732 \begin_layout Standard
1736 \begin_layout Standard
1740 color{beamerexample}
1743 \begin_layout Standard
1747 \begin_layout Standard
1751 pgfsetlinewidth{0.6pt}
1754 \begin_layout Standard
1758 \begin_layout Standard
1767 \begin_layout Standard
1771 \begin_layout Standard
1780 \begin_layout Standard
1784 \begin_layout Standard
1793 \begin_layout Standard
1797 \begin_layout Standard
1806 \begin_layout Standard
1810 \begin_layout Standard
1814 \begin_layout Standard
1818 \begin_layout Standard
1825 \begin_layout Standard
1829 \begin_layout Standard
1837 pgfbox[center,center]{$t$}}
1840 \begin_layout Standard
1844 \begin_layout Standard
1852 pgfbox[center,center]{$s$}}
1855 \begin_layout Standard
1859 \begin_layout Standard
1863 \begin_layout Standard
1867 \begin_layout Standard
1871 color{beamerexample}
1874 \begin_layout Standard
1878 \begin_layout Standard
1887 \begin_layout Standard
1891 \begin_layout Standard
1895 pgfnodesetsepstart{2pt}
1898 \begin_layout Standard
1902 \begin_layout Standard
1906 pgfnodesetsepend{4pt}
1909 \begin_layout Standard
1913 \begin_layout Standard
1918 \begin_layout Standard
1922 \begin_layout Standard
1928 pgfnodeconnline{A}{B}}
1931 \begin_layout Standard
1935 \begin_layout Standard
1941 pgfnodeconnline{A}{C}}
1944 \begin_layout Standard
1948 \begin_layout Standard
1954 pgfnodeconnline{D}{A}}
1957 \begin_layout Standard
1961 \begin_layout Standard
1967 pgfnodeconnline{C}{B}}
1970 \begin_layout Standard
1974 \begin_layout Standard
1978 pgfnodeconnline{B}{D}
1981 \begin_layout Standard
1985 \begin_layout Standard
1989 pgfnodeconnline{D}{C}
1992 \begin_layout Standard
1996 \begin_layout Standard
2001 \begin_layout Standard
2005 \begin_layout Standard
2015 pgfbox[left,center]{
2020 \begin_layout Standard
2024 \begin_layout Standard
2038 \begin_layout Standard
2042 \begin_layout Standard
2058 \begin_layout Standard
2060 {Variants of Path Finding Problems}
2069 \begin_layout Standard
2073 \begin_layout Standard
2077 usedescriptionitemofwidthas{Approximation Problem:}
2085 \begin_layout Description
2086 Reachability\InsetSpace ~
2091 \begin_layout Standard
2098 Is there a path from
2099 \begin_inset Formula $s$
2104 \begin_inset Formula $t$
2110 \begin_layout Description
2111 Construction\InsetSpace ~
2116 \begin_layout Standard
2123 Construct a path from
2124 \begin_inset Formula $s$
2129 \begin_inset Formula $t$
2135 \begin_layout Description
2136 Optimization\InsetSpace ~
2141 \begin_layout Standard
2148 Construct a shortest path from
2149 \begin_inset Formula $s$
2154 \begin_inset Formula $t$
2160 \begin_layout Description
2161 Distance\InsetSpace ~
2166 \begin_layout Standard
2174 \begin_inset Formula $s$
2179 \begin_inset Formula $t$
2182 at most\InsetSpace ~
2184 \begin_inset Formula $d$
2190 \begin_layout Description
2191 Approximation\InsetSpace ~
2196 \begin_layout Standard
2203 Construct a path from
2204 \begin_inset Formula $s$
2209 \begin_inset Formula $t$
2214 approximately their distance.
2219 \begin_layout Section
2223 \begin_layout Subsection
2224 Standard Complexity Classes
2227 \begin_layout Standard
2231 \begin_layout Standard
2235 pgfdeclaremask{computer-mask}{beamer-g4-mask}
2237 pgfdeclareimage[height=2cm,mask=computer-mask,interpolate=true]{computer}{beamer
2246 \begin_layout BeginFrame
2247 The Classes L and NL are Defined via
2249 Logspace Turing Machines
2252 \begin_layout Standard
2256 \begin_layout Standard
2260 begin{pgfpicture}{-0.5cm}{0cm}{8cm}{5cm}
2263 \begin_layout Standard
2267 \begin_layout Standard
2275 tape{input tape (read only), $n$ symbols}{}{3401234*3143223=}}
2278 \begin_layout Standard
2282 \begin_layout Standard
2289 \begin_layout Standard
2293 \begin_layout Standard
2301 tape{}{output tape (write only)}{10690836937182}}}
2304 \begin_layout Standard
2308 \begin_layout Standard
2315 \begin_layout Standard
2319 \begin_layout Standard
2327 shorttape{work tape (read/write), $O(
2329 log n)$ symbols}{}{42}}
2332 \begin_layout Standard
2336 \begin_layout Standard
2344 pgfbox[center,center]{
2346 pgfuseimage{computer}}}
2349 \begin_layout Standard
2353 \begin_layout Standard
2358 \begin_layout Standard
2362 \begin_layout Standard
2366 pgfsetlinewidth{0.6pt}
2369 \begin_layout Standard
2373 \begin_layout Standard
2377 \begin_layout Standard
2381 \begin_layout Standard
2388 \begin_layout Standard
2392 \begin_layout Standard
2401 \begin_layout Standard
2405 \begin_layout Standard
2409 pgfxycurve(1.75,3.5)(1.75,3.75)(0,3.5)(0,3.85)
2412 \begin_layout Standard
2416 \begin_layout Standard
2422 pgfxycurve(1.75,1.5)(1.75,1)(0,1.5)(0,1.05)}
2425 \begin_layout Standard
2429 \begin_layout Standard
2435 pgfxycurve(2.65,2.5)(3.75,2.5)(7,1)(7,1.9)}
2438 \begin_layout Standard
2442 \begin_layout Standard
2454 \begin_layout BeginFrame
2455 Logspace Turing Machines Are Quite Powerful
2462 \begin_layout Standard
2464 {Deterministic logspace machines can compute}
2473 \begin_layout Itemize
2474 addition, multiplication, and even division
2477 \begin_layout Itemize
2478 reductions used in completeness proofs,
2481 \begin_layout Itemize
2482 reachability in forests.
2494 \begin_layout Standard
2496 {Non-deterministic logspace machines can compute}
2505 \begin_layout Itemize
2506 reachability in graphs,
2509 \begin_layout Itemize
2510 non-reachability in graphs,
2513 \begin_layout Itemize
2514 satisfiability with two literals per clause.
2518 \begin_layout BeginFrame
2522 \begin_layout Standard
2524 <1>[label=hierarchy]
2529 The Complexity Class Hierarchy
2532 \begin_layout Standard
2536 \begin_layout Standard
2540 begin{pgfpicture}{-5.4cm}{0cm}{5.4cm}{5.5cm}
2543 \begin_layout Standard
2547 \begin_layout Standard
2551 pgfsetlinewidth{0.8pt}
2554 \begin_layout Standard
2558 \begin_layout Standard
2567 \begin_layout Standard
2571 \begin_layout Standard
2575 pgfsetdash{{2pt}}{0pt}
2578 \begin_layout Standard
2582 \begin_layout Standard
2590 Class{NC}^2$}{black!50!structure}{2}}
2593 \begin_layout Standard
2597 \begin_layout Standard
2603 Class{NL}$}{black!50!structure}{3}
2606 \begin_layout Standard
2610 \begin_layout Standard
2616 Class{L}$}{black!50!structure}{4}
2619 \begin_layout Standard
2623 \begin_layout Standard
2635 Class{NC}^1}$}{black!50!structure}{5}}
2638 \begin_layout Standard
2642 \begin_layout Standard
2649 \begin_layout Standard
2653 \begin_layout Standard
2665 Class{AC}^0}$}{black}{6}}
2668 \begin_layout Standard
2672 \begin_layout Standard
2676 \begin_layout Standard
2680 \begin_layout Standard
2684 pgfsetlinewidth{1.0pt}
2687 \begin_layout Standard
2691 \begin_layout Standard
2698 \begin_layout Standard
2702 \begin_layout Standard
2706 pgfxyline(-5,0)(5,0)
2709 \begin_layout Standard
2713 \begin_layout Standard
2717 \begin_layout Standard
2721 \begin_layout Standard
2732 \begin_layout Standard
2736 \begin_layout Standard
2746 operatorname{forest}}$}}
2749 \begin_layout Standard
2753 \begin_layout Standard
2757 \begin_layout Standard
2761 \begin_layout Standard
2772 \begin_layout Standard
2776 \begin_layout Standard
2795 \begin_layout Standard
2799 \begin_layout Standard
2818 \begin_layout Standard
2822 \begin_layout Standard
2835 \begin_layout Standard
2839 \begin_layout Standard
2847 operatorname{forest}}$,}
2852 \begin_layout Standard
2856 \begin_layout Standard
2864 operatorname{forest}}$,}
2869 \begin_layout Standard
2873 \begin_layout Standard
2881 operatorname{path}}$,}
2886 \begin_layout Standard
2890 \begin_layout Standard
2898 operatorname{path}}$}}}}
2901 \begin_layout Standard
2905 \begin_layout Standard
2915 operatorname{tourn}}$}}
2918 \begin_layout Standard
2922 \begin_layout Standard
2935 \begin_layout Standard
2939 \begin_layout Standard
2947 operatorname{tourn}}$,}
2952 \begin_layout Standard
2956 \begin_layout Standard
2967 \begin_layout Standard
2971 \begin_layout Standard
2980 \begin_layout Standard
2984 \begin_layout Standard
2990 pgfsetdash{{1pt}}{0pt}
2996 operatorname{tourn}}$''}}
2999 \begin_layout Standard
3003 \begin_layout Standard
3015 \begin_layout BeginFrame
3016 The Circuit Complexity Classes AC
3017 \begin_inset Formula $^{0}$
3021 \begin_inset Formula $^{1}$
3025 \begin_inset Formula $^{2}$
3030 Limit the Circuit Depth
3033 \begin_layout Standard
3037 \begin_layout Standard
3046 \begin_layout Standard
3050 \begin_layout Standard
3062 \begin_layout Columns
3066 \begin_layout Standard
3077 \begin_layout Column
3085 \begin_layout Standard
3093 \begin_inset Formula $\Class{AC}^{0}$
3100 \begin_layout Standard
3111 \begin_layout Itemize
3112 \begin_inset Formula $O(1)$
3118 \begin_layout Itemize
3123 \begin_layout Examples
3128 \begin_layout Itemize
3129 \begin_inset Formula $\Lang{addition}\in\Class{AC}^{0}$
3135 \begin_layout Itemize
3136 \begin_inset Formula $\Lang{parity}\notin\Class{AC}^{0}$
3147 \begin_layout Column
3155 \begin_layout Standard
3163 \begin_inset Formula $\Class{NC}^{1}$
3170 \begin_layout Standard
3181 \begin_layout Itemize
3182 \begin_inset Formula $O(\log n)$
3188 \begin_layout Itemize
3193 \begin_layout Examples
3198 \begin_layout Itemize
3199 \begin_inset Formula $\Lang{parity}\in\Class{NC}^{1}$
3205 \begin_layout Itemize
3206 \begin_inset Formula $\Lang{mutiply}\in\Class{NC}^{1}$
3212 \begin_layout Itemize
3213 \begin_inset Formula $\Lang{divide}\in\Class{NC}^{1}$
3224 \begin_layout Column
3232 \begin_layout Standard
3240 \begin_inset Formula $\Class{NC}^{2}$
3247 \begin_layout Standard
3258 \begin_layout Itemize
3259 \begin_inset Formula $O(\log^{2}n)$
3265 \begin_layout Itemize
3270 \begin_layout Examples
3275 \begin_layout Itemize
3276 \begin_inset Formula $\Class{NL}\subseteq\Class{NC}^{2}$
3284 \begin_layout AgainFrame
3288 \begin_layout Standard
3298 \begin_layout Subsection
3299 Standard Complexity Results on Finding Paths
3302 \begin_layout BeginFrame
3303 All Variants of Finding Paths in Directed Graphs
3305 Are Equally Difficult
3309 \begin_inset Formula $\Lang{reach}$
3313 \begin_inset Formula $\Lang{distance}$
3317 \begin_inset Formula $\Class{NL}$
3328 \begin_layout Corollary
3329 For directed graphs, we can solve
3333 \begin_layout Itemize
3334 the reachability problem in logspace iff
3335 \begin_inset Formula $\Class{L}=\Class{NL}$
3341 \begin_layout Itemize
3342 the construction problem in logspace iff
3343 \begin_inset Formula $\Class{L}=\Class{NL}$
3349 \begin_layout Itemize
3350 the optimization problem in logspace iff
3351 \begin_inset Formula $\Class{L}=\Class{NL}$
3357 \begin_layout Itemize
3358 the approximation problem in logspace iff
3359 \begin_inset Formula $\Class{L}=\Class{NL}$
3366 \begin_layout AgainFrame
3370 \begin_layout Standard
3380 \begin_layout BeginFrame
3381 FindingPaths in Forests and Directed Paths is Easy,
3387 \begin_inset Formula $\Lang{reach}_{\operatorname{forest}}$
3391 \begin_inset Formula $\Lang{distance}_{\operatorname{forest}}$
3395 \begin_inset Formula $\Class{L}$
3401 \begin_layout Separator
3406 \begin_inset Formula $\Lang{reach}_{\operatorname{path}}$
3410 \begin_inset Formula $\Lang{distance}_{\operatorname{path}}$
3414 \begin_inset Formula $\Class{L}$
3420 \begin_layout AgainFrame
3424 \begin_layout Standard
3434 \begin_layout Section
3435 Finding Paths in Tournaments
3438 \begin_layout Subsection
3439 Complexity of: Does a Path Exist?
3442 \begin_layout BeginFrame
3443 Definition of the Tournament Reachability Problem
3446 \begin_layout Definition
3450 \begin_inset Formula $\Lang{reach}_{\operatorname{tourn}}$
3456 \begin_inset Formula $(T,s,t)$
3463 \begin_layout Enumerate
3464 \begin_inset Formula $T=(V,E)$
3470 \begin_layout Enumerate
3471 there exists a path from\InsetSpace ~
3473 \begin_inset Formula $s$
3478 \begin_inset Formula $t$
3485 \begin_layout BeginFrame
3486 The Tournament Reachability Problem is Very Easy
3489 \begin_layout Theorem
3490 \begin_inset Formula $\Lang{reach}_{\operatorname{tourn}}\in\Class{AC}^{0}$
3500 \begin_layout AlertBlock
3504 \begin_layout Standard
3515 \begin_layout Itemize
3517 \begin_inset Quotes eld
3521 \begin_inset Quotes erd
3525 \begin_inset Formula $\Lang{reach}$
3529 \begin_inset Formula $\Lang{reach}_{\operatorname{path}}$
3535 \begin_layout Itemize
3536 \begin_inset Formula $\Lang{reach}\not\le_{\operatorname{m}}^{\Class{AC}^{0}}\Lang{reach}_{\operatorname{tourn}}$
3543 \begin_layout AgainFrame
3547 \begin_layout Standard
3557 \begin_layout Subsection
3558 Complexity of: Construct a Shortest Path
3561 \begin_layout BeginFrame
3562 Finding a Shortest Path Is as Difficult as
3564 the Distance Problem
3567 \begin_layout Definition
3571 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3577 \begin_inset Formula $(T,s,t,d)$
3584 \begin_layout Enumerate
3585 \begin_inset Formula $T=(V,E)$
3588 is a tournament in which
3591 \begin_layout Enumerate
3593 \begin_inset Formula $s$
3598 \begin_inset Formula $t$
3601 is at most\InsetSpace ~
3603 \begin_inset Formula $d$
3610 \begin_layout BeginFrame
3611 The Tournament Distance Problem is Hard
3614 \begin_layout Theorem
3615 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3619 \begin_inset Formula $\Class{NL}$
3625 \begin_layout Standard
3632 \begin_layout Standard
3636 hyperlink{hierarchy<6>}{
3638 beamerskipbutton{Skip Proof}}
3650 \begin_layout Corollary
3651 Shortest path in tournaments can be constructed
3653 in logarithmic space, iff
3655 \begin_inset Formula $\Class{L}=\Class{NL}$
3665 \begin_layout Corollary
3666 \begin_inset Formula $\Lang{distance}\le_{\operatorname{m}}^{\Class{AC}^{0}}\Lang{distance}_{\operatorname{tourn}}$
3672 \begin_layout BeginFrame
3674 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3680 \begin_layout Standard
3684 \begin_layout Standard
3696 \begin_layout Columns
3700 \begin_layout Standard
3711 \begin_layout Column
3715 \begin_layout Standard
3719 \begin_layout Standard
3737 \begin_layout Standard
3745 \begin_inset Formula $\Lang{reach}$
3749 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}$
3756 \begin_layout Standard
3767 \begin_layout Enumerate
3771 \begin_layout Standard
3779 \begin_inset Formula $(G,s,t)$
3783 \begin_inset Formula $\Lang{reach}$
3789 \begin_layout Enumerate
3793 \begin_layout Standard
3801 \begin_inset Formula $G$
3805 \begin_inset Formula $G'$
3811 \begin_layout Enumerate
3815 \begin_layout Standard
3825 \begin_inset Formula $(G',s',t',3)\in\Lang{distance}_{\operatorname{tourn}}$
3832 \begin_layout Separator
3840 \begin_layout Standard
3851 \begin_layout Standard
3862 \begin_layout Standard
3873 \begin_layout Enumerate
3877 \begin_layout Standard
3884 A path in\InsetSpace ~
3886 \begin_inset Formula $G$
3891 a length-3 path in\InsetSpace ~
3893 \begin_inset Formula $G'$
3899 \begin_layout Enumerate
3903 \begin_layout Standard
3910 A length-3 path in\InsetSpace ~
3912 \begin_inset Formula $G'$
3917 a path in\InsetSpace ~
3919 \begin_inset Formula $G'$
3926 \begin_layout Column
3930 \begin_layout Example
3934 \begin_layout Standard
3938 begin{pgfpicture}{0cm}{-1.25cm}{4.5cm}{3.75cm}
3941 \begin_layout Standard
3945 \begin_layout Standard
3949 color{beamerexample}
3952 \begin_layout Standard
3956 \begin_layout Standard
3960 pgfsetlinewidth{0.6pt}
3963 \begin_layout Standard
3967 \begin_layout Standard
3976 \begin_layout Standard
3980 \begin_layout Standard
3989 \begin_layout Standard
3993 \begin_layout Standard
4002 \begin_layout Standard
4006 \begin_layout Standard
4015 \begin_layout Standard
4019 \begin_layout Standard
4023 \begin_layout Standard
4027 \begin_layout Standard
4034 \begin_layout Standard
4038 \begin_layout Standard
4046 pgfbox[center,center]{$s$}}
4049 \begin_layout Standard
4053 \begin_layout Standard
4061 pgfbox[center,center]{$t$}}
4064 \begin_layout Standard
4068 \begin_layout Standard
4072 \begin_layout Standard
4076 \begin_layout Standard
4080 color{beamerexample}
4083 \begin_layout Standard
4087 \begin_layout Standard
4096 \begin_layout Standard
4100 \begin_layout Standard
4104 pgfnodesetsepstart{2pt}
4107 \begin_layout Standard
4111 \begin_layout Standard
4115 pgfnodesetsepend{2pt}
4118 \begin_layout Standard
4122 \begin_layout Standard
4128 pgfnodeconnline{B}{A}}
4131 \begin_layout Standard
4135 \begin_layout Standard
4141 pgfnodeconnline{B}{C}}
4144 \begin_layout Standard
4148 \begin_layout Standard
4154 pgfnodeconnline{C}{D}}
4157 \begin_layout Standard
4161 \begin_layout Standard
4167 pgfnodeconncurve{A}{C}{45}{135}{15pt}{15pt}}
4170 \begin_layout Standard
4174 \begin_layout Standard
4179 \begin_layout Standard
4183 \begin_layout Standard
4191 pgfbox[left,center]{$G
4196 \begin_layout Standard
4200 \begin_layout Standard
4204 \begin_layout Standard
4208 \begin_layout Standard
4215 \begin_layout Standard
4219 \begin_layout Standard
4227 pgfbox[left,center]{$G'
4232 \begin_layout Standard
4236 \begin_layout Standard
4245 \begin_layout Standard
4249 \begin_layout Standard
4258 \begin_layout Standard
4262 \begin_layout Standard
4271 \begin_layout Standard
4275 \begin_layout Standard
4284 \begin_layout Standard
4288 \begin_layout Standard
4292 \begin_layout Standard
4296 \begin_layout Standard
4305 \begin_layout Standard
4309 \begin_layout Standard
4318 \begin_layout Standard
4322 \begin_layout Standard
4331 \begin_layout Standard
4335 \begin_layout Standard
4344 \begin_layout Standard
4348 \begin_layout Standard
4357 \begin_layout Standard
4361 \begin_layout Standard
4370 \begin_layout Standard
4374 \begin_layout Standard
4383 \begin_layout Standard
4387 \begin_layout Standard
4396 \begin_layout Standard
4400 \begin_layout Standard
4409 \begin_layout Standard
4413 \begin_layout Standard
4422 \begin_layout Standard
4426 \begin_layout Standard
4435 \begin_layout Standard
4439 \begin_layout Standard
4448 \begin_layout Standard
4452 \begin_layout Standard
4459 \begin_layout Standard
4463 \begin_layout Standard
4471 pgfbox[center,center]{$s'$}}
4474 \begin_layout Standard
4478 \begin_layout Standard
4486 pgfbox[center,center]{$t'$}}
4489 \begin_layout Standard
4493 \begin_layout Standard
4498 \begin_layout Standard
4502 \begin_layout Standard
4507 \begin_layout Standard
4511 \begin_layout Standard
4518 \begin_layout Standard
4522 \begin_layout Standard
4526 pgfsetlinewidth{0.4pt}
4529 \begin_layout Standard
4533 \begin_layout Standard
4537 color{beamerexample!25!averagebackgroundcolor}
4540 \begin_layout Standard
4544 \begin_layout Standard
4548 pgfnodeconnline{A2}{C1}
4551 \begin_layout Standard
4555 \begin_layout Standard
4559 pgfnodeconnline{A2}{D1}
4562 \begin_layout Standard
4566 \begin_layout Standard
4570 pgfnodeconnline{B2}{A1}
4573 \begin_layout Standard
4577 \begin_layout Standard
4581 pgfnodeconnline{B2}{C1}
4584 \begin_layout Standard
4588 \begin_layout Standard
4592 pgfnodeconnline{B2}{D1}
4595 \begin_layout Standard
4599 \begin_layout Standard
4603 pgfnodeconnline{C2}{D1}
4606 \begin_layout Standard
4610 \begin_layout Standard
4614 pgfnodeconnline{D2}{A1}
4617 \begin_layout Standard
4621 \begin_layout Standard
4625 pgfnodeconnline{D2}{B1}
4628 \begin_layout Standard
4632 \begin_layout Standard
4636 pgfnodeconnline{A3}{C2}
4639 \begin_layout Standard
4643 \begin_layout Standard
4647 pgfnodeconnline{A3}{D2}
4650 \begin_layout Standard
4654 \begin_layout Standard
4658 pgfnodeconnline{B3}{A2}
4661 \begin_layout Standard
4665 \begin_layout Standard
4669 pgfnodeconnline{B3}{C2}
4672 \begin_layout Standard
4676 \begin_layout Standard
4680 pgfnodeconnline{B3}{D2}
4683 \begin_layout Standard
4687 \begin_layout Standard
4691 pgfnodeconnline{C3}{D2}
4694 \begin_layout Standard
4698 \begin_layout Standard
4702 pgfnodeconnline{D3}{A2}
4705 \begin_layout Standard
4709 \begin_layout Standard
4713 pgfnodeconnline{D3}{B2}
4716 \begin_layout Standard
4720 \begin_layout Standard
4724 pgfnodeconnline{A4}{C3}
4727 \begin_layout Standard
4731 \begin_layout Standard
4735 pgfnodeconnline{A4}{D3}
4738 \begin_layout Standard
4742 \begin_layout Standard
4746 pgfnodeconnline{B4}{A3}
4749 \begin_layout Standard
4753 \begin_layout Standard
4757 pgfnodeconnline{B4}{C3}
4760 \begin_layout Standard
4764 \begin_layout Standard
4768 pgfnodeconnline{B4}{D3}
4771 \begin_layout Standard
4775 \begin_layout Standard
4779 pgfnodeconnline{C4}{D3}
4782 \begin_layout Standard
4786 \begin_layout Standard
4790 pgfnodeconnline{D4}{A3}
4793 \begin_layout Standard
4797 \begin_layout Standard
4801 pgfnodeconnline{D4}{B3}
4804 \begin_layout Standard
4808 \begin_layout Standard
4812 \begin_layout Standard
4816 \begin_layout Standard
4825 \begin_layout Standard
4829 \begin_layout Standard
4833 pgfnodeconnline{A1}{B1}
4836 \begin_layout Standard
4840 \begin_layout Standard
4844 pgfnodeconnline{B1}{C1}
4847 \begin_layout Standard
4851 \begin_layout Standard
4855 pgfnodeconnline{C1}{D1}
4858 \begin_layout Standard
4862 \begin_layout Standard
4866 pgfnodeconnline{A2}{B2}
4869 \begin_layout Standard
4873 \begin_layout Standard
4877 pgfnodeconnline{B2}{C2}
4880 \begin_layout Standard
4884 \begin_layout Standard
4888 pgfnodeconnline{C2}{D2}
4891 \begin_layout Standard
4895 \begin_layout Standard
4899 pgfnodeconnline{A3}{B3}
4902 \begin_layout Standard
4906 \begin_layout Standard
4910 pgfnodeconnline{B3}{C3}
4913 \begin_layout Standard
4917 \begin_layout Standard
4921 pgfnodeconnline{C3}{D3}
4924 \begin_layout Standard
4928 \begin_layout Standard
4932 pgfnodeconnline{A4}{B4}
4935 \begin_layout Standard
4939 \begin_layout Standard
4943 pgfnodeconnline{B4}{C4}
4946 \begin_layout Standard
4950 \begin_layout Standard
4954 pgfnodeconnline{C4}{D4}
4957 \begin_layout Standard
4961 \begin_layout Standard
4965 \begin_layout Standard
4969 \begin_layout Standard
4976 \begin_layout Standard
4980 \begin_layout Standard
4984 pgfnodeconncurve{A3}{A1}{135}{-135}{10pt}{10pt}
4987 \begin_layout Standard
4991 \begin_layout Standard
4995 pgfnodeconncurve{A4}{A2}{135}{-135}{10pt}{10pt}
4998 \begin_layout Standard
5002 \begin_layout Standard
5006 pgfnodeconncurve{A4}{A1}{135}{-135}{15pt}{15pt}
5009 \begin_layout Standard
5013 \begin_layout Standard
5017 pgfnodeconncurve{B3}{B1}{135}{-135}{10pt}{10pt}
5020 \begin_layout Standard
5024 \begin_layout Standard
5028 pgfnodeconncurve{B4}{B2}{135}{-135}{10pt}{10pt}
5031 \begin_layout Standard
5035 \begin_layout Standard
5039 pgfnodeconncurve{B4}{B1}{135}{-135}{15pt}{15pt}
5042 \begin_layout Standard
5046 \begin_layout Standard
5050 pgfnodeconncurve{C3}{C1}{135}{-135}{10pt}{10pt}
5053 \begin_layout Standard
5057 \begin_layout Standard
5061 pgfnodeconncurve{C4}{C2}{135}{-135}{10pt}{10pt}
5064 \begin_layout Standard
5068 \begin_layout Standard
5072 pgfnodeconncurve{C4}{C1}{135}{-135}{15pt}{15pt}
5075 \begin_layout Standard
5079 \begin_layout Standard
5083 pgfnodeconncurve{D3}{D1}{135}{-135}{10pt}{10pt}
5086 \begin_layout Standard
5090 \begin_layout Standard
5094 pgfnodeconncurve{D4}{D2}{135}{-135}{10pt}{10pt}
5097 \begin_layout Standard
5101 \begin_layout Standard
5105 pgfnodeconncurve{D4}{D1}{135}{-135}{15pt}{15pt}
5108 \begin_layout Standard
5112 \begin_layout Standard
5116 color{beamerexample}
5119 \begin_layout Standard
5123 \begin_layout Standard
5127 pgfsetlinewidth{0.6pt}
5130 \begin_layout Standard
5134 \begin_layout Standard
5139 \begin_layout Standard
5143 \begin_layout Standard
5147 \begin_layout Standard
5151 \begin_layout Standard
5158 \begin_layout Standard
5162 \begin_layout Standard
5169 \begin_layout Standard
5173 \begin_layout Standard
5177 pgfnodeconnline{B1}{A2}
5180 \begin_layout Standard
5184 \begin_layout Standard
5188 pgfnodeconnline{B2}{A3}
5191 \begin_layout Standard
5195 \begin_layout Standard
5199 pgfnodeconnline{B3}{A4}
5202 \begin_layout Standard
5206 \begin_layout Standard
5211 \begin_layout Standard
5215 \begin_layout Standard
5219 \begin_layout Standard
5223 \begin_layout Standard
5230 \begin_layout Standard
5234 \begin_layout Standard
5241 \begin_layout Standard
5245 \begin_layout Standard
5249 pgfnodeconnline{B1}{C2}
5252 \begin_layout Standard
5256 \begin_layout Standard
5260 pgfnodeconnline{B2}{C3}
5263 \begin_layout Standard
5267 \begin_layout Standard
5271 pgfnodeconnline{B3}{C4}
5274 \begin_layout Standard
5278 \begin_layout Standard
5283 \begin_layout Standard
5287 \begin_layout Standard
5292 \begin_layout Standard
5296 \begin_layout Standard
5303 \begin_layout Standard
5307 \begin_layout Standard
5314 \begin_layout Standard
5318 \begin_layout Standard
5322 pgfnodeconnline{C1}{D2}
5325 \begin_layout Standard
5329 \begin_layout Standard
5335 pgfnodeconnline{C2}{D3}}
5338 \begin_layout Standard
5342 \begin_layout Standard
5348 pgfnodeconnline{C3}{D4}}
5351 \begin_layout Standard
5355 \begin_layout Standard
5360 \begin_layout Standard
5364 \begin_layout Standard
5369 \begin_layout Standard
5373 \begin_layout Standard
5380 \begin_layout Standard
5384 \begin_layout Standard
5391 \begin_layout Standard
5395 \begin_layout Standard
5401 pgfnodeconnline{A1}{C2}}
5404 \begin_layout Standard
5408 \begin_layout Standard
5414 pgfnodeconnline{A2}{C3}}
5417 \begin_layout Standard
5421 \begin_layout Standard
5425 pgfnodeconnline{A3}{C4}
5428 \begin_layout Standard
5432 \begin_layout Standard
5437 \begin_layout Standard
5441 \begin_layout Standard
5445 \begin_layout Standard
5449 \begin_layout Standard
5456 \begin_layout Standard
5460 \begin_layout Standard
5467 \begin_layout Standard
5471 \begin_layout Standard
5477 pgfnodeconnline{A1}{A2}}
5480 \begin_layout Standard
5484 \begin_layout Standard
5488 pgfnodeconnline{A2}{A3}
5491 \begin_layout Standard
5495 \begin_layout Standard
5499 pgfnodeconnline{A3}{A4}
5502 \begin_layout Standard
5506 \begin_layout Standard
5510 pgfnodeconnline{B1}{B2}
5513 \begin_layout Standard
5517 \begin_layout Standard
5521 pgfnodeconnline{B2}{B3}
5524 \begin_layout Standard
5528 \begin_layout Standard
5532 pgfnodeconnline{B3}{B4}
5535 \begin_layout Standard
5539 \begin_layout Standard
5543 pgfnodeconnline{C1}{C2}
5546 \begin_layout Standard
5550 \begin_layout Standard
5554 pgfnodeconnline{C2}{C3}
5557 \begin_layout Standard
5561 \begin_layout Standard
5565 pgfnodeconnline{C3}{C4}
5568 \begin_layout Standard
5572 \begin_layout Standard
5576 pgfnodeconnline{D1}{D2}
5579 \begin_layout Standard
5583 \begin_layout Standard
5587 pgfnodeconnline{D2}{D3}
5590 \begin_layout Standard
5594 \begin_layout Standard
5600 pgfnodeconnline{D3}{D4}}
5603 \begin_layout Standard
5607 \begin_layout Standard
5612 \begin_layout Standard
5616 \begin_layout Standard
5629 \begin_layout AgainFrame
5633 \begin_layout Standard
5643 \begin_layout Subsection
5644 Complexity of: Approximating the Shortest Path
5647 \begin_layout BeginFrame
5648 Approximators Compute Paths that Are Nearly As Short As a Shortest Path
5651 \begin_layout Definition
5654 approximation scheme for
5655 \begin_inset Formula $\Lang{tournament-shortest-path}$
5664 \begin_layout Enumerate
5666 \begin_inset Formula $(T,s,t)\in\Lang{reach}_{\operatorname{tourn}}$
5672 \begin_layout Enumerate
5674 \begin_inset Formula $r>1$
5680 \begin_layout Standard
5684 \begin_layout Itemize
5686 \begin_inset Formula $s$
5691 \begin_inset Formula $t$
5695 \begin_inset Formula $r\operatorname{d_{T}}(s,t)$
5702 \begin_layout BeginFrame
5703 There Exists a Logspace Approximation Scheme for
5705 the Tournament Shortest
5709 \begin_layout Theorem
5710 There exists an approximation scheme for
5711 \begin_inset Formula $\Lang{tournament-shortest-path}$
5715 \begin_inset Formula $1<r<2$
5719 \begin_inset Formula \[
5720 O\left(\log|V|\log\frac{1}{r-1}\right).\]
5731 \begin_layout Corollary
5732 In tournaments, paths can be constructed in logarithmic space.
5735 \begin_layout Standard
5742 \begin_layout Standard
5746 hyperlink{optimality}{
5748 beamergotobutton{More Details}}
5756 \begin_layout AgainFrame
5760 \begin_layout Standard
5770 \begin_layout Section*
5774 \begin_layout Subsection*
5778 \begin_layout BeginFrame
5786 \begin_layout Standard
5797 \begin_layout Itemize
5805 \begin_inset Formula $\Class{AC}^{0}$
5814 \begin_layout Itemize
5817 logspace approximation scheme
5823 shortest paths in tournaments.
5826 \begin_layout Itemize
5834 \begin_inset Formula $\Class{NL}$
5843 \begin_layout Separator
5851 \begin_layout Standard
5862 \begin_layout Itemize
5863 The same results apply to graphs with
5865 bounded independence number.
5871 \begin_layout Standard
5875 hyperlink{independence}{
5877 beamergotobutton{More Details}}
5885 \begin_layout Itemize
5886 The complexity of finding paths in undirected graphs
5894 \begin_layout Standard
5898 hyperlink{undirected}{
5900 beamergotobutton{More Details}}
5909 \begin_layout Subsection*
5913 \begin_layout BeginFrame
5917 \begin_layout Standard
5921 \begin_layout Standard
5925 beamertemplatebookbibitems
5933 \begin_layout Bibliography
5942 \begin_layout Standard
5953 Topics on Tournaments.
5960 \begin_layout Standard
5969 Holt, Rinehart, and Winston, 1968.
5974 \begin_layout Standard
5978 beamertemplatearticlebibitems
5986 \begin_layout Bibliography
5988 \bibitem {NickelsenT2002}
5990 Arfst Nickelsen and Till Tantau.
5995 \begin_layout Standard
6004 On reachability in graphs with bounded independence number.
6008 \begin_layout Standard
6022 , Springer-Verlag, 2002.
6025 \begin_layout Bibliography
6027 \bibitem {Tantau2004b}
6033 \begin_layout Standard
6042 A logspace approximation scheme for the shortest path problem for graphs
6043 with bounded independence number.
6047 \begin_layout Standard
6061 , Springer-Verlag, 2004.
6066 \begin_layout Standard
6078 \begin_layout EndFrame
6082 \begin_layout Standard
6087 \begin_layout Standard
6091 AtBeginSubsection[]{}
6099 \begin_layout Section
6103 \begin_layout Subsection
6104 Graphs With Bounded Independence Number
6107 \begin_layout BeginFrame
6111 \begin_layout Standard
6113 [label=independence]
6118 Definition of Independence Number of a Graph
6121 \begin_layout Definition
6127 \begin_inset Formula $\alpha(G)$
6132 is the maximum number of vertices we can pick,
6135 there is no edge between them.
6138 \begin_layout Example
6139 Tournaments have independence number 1.
6143 \begin_layout BeginFrame
6144 The Results for Tournaments also Apply to
6146 Graphs With Bounded Independence
6150 \begin_layout Theorem
6151 For each\InsetSpace ~
6153 \begin_inset Formula $k$
6160 in graphs with independence number
6162 at most\InsetSpace ~
6164 \begin_inset Formula $k$
6168 \begin_inset Formula $\Class{AC}^{0}$
6174 \begin_layout Separator
6178 \begin_layout Theorem
6179 For each\InsetSpace ~
6181 \begin_inset Formula $k$
6186 logspace approximation scheme
6188 for approximating the shortest path in graphs with independence number
6189 at most\InsetSpace ~
6191 \begin_inset Formula $k$
6197 \begin_layout Separator
6201 \begin_layout Theorem
6202 For each\InsetSpace ~
6204 \begin_inset Formula $k$
6211 in graphs with independence number at most\InsetSpace ~
6213 \begin_inset Formula $k$
6219 \begin_inset Formula $\Class{NL}$
6227 \begin_layout Subsection
6228 Finding Paths in Undirected Graphs
6231 \begin_layout BeginFrame
6235 \begin_layout Standard
6237 <1-2>[label=undirected]
6242 The Complexity of Finding Paths in Undirected Graphs
6248 \begin_inset Formula $\Lang{reach}_{\operatorname{undirected}}$
6252 \begin_inset Formula $\Class{SL}$
6258 \begin_layout Corollary
6259 For undirected graphs, we can solve
6263 \begin_layout Itemize
6264 the reachability problem in logspace iff
6265 \begin_inset Formula $\Class L=\Class{SL}$
6271 \begin_layout Itemize
6272 the construction problem in logspace iff
6276 \begin_layout Standard
6294 \begin_layout Itemize
6295 the optimization problem in logspace iff
6299 \begin_layout Standard
6317 \begin_layout Itemize
6318 the approximation problem in logspace iff ?.
6323 \begin_layout Subsection
6324 The Approximation Scheme is Optimal
6327 \begin_layout BeginFrame
6331 \begin_layout Standard
6338 The Approximation Scheme is Optimal
6341 \begin_layout Theorem
6342 Suppose there exists an approximation scheme for
6343 \begin_inset Formula $\Lang{tournament-shortest-path}$
6347 \begin_inset Formula $O\bigl(\log|V|\log^{1-\epsilon}\frac{1}{r-1}\bigr)$
6352 \begin_inset Formula $\Class{NL}\subseteq\Class{DSPACE}\bigl[\log^{2-\epsilon}n\bigr]$
6363 \begin_layout Enumerate
6364 Suppose the approximation scheme exists.
6367 \begin_inset Formula $\Lang{distance}_{\operatorname{tourn}}\in\Class{DSPACE}\bigl[\log^{2-\epsilon}n\bigr]$
6374 \begin_layout Enumerate
6376 \begin_inset Formula $(T,s,t)$
6381 \begin_inset Formula $n$
6384 be the number of vertices.
6387 \begin_layout Enumerate
6388 Run the approximation scheme for
6389 \begin_inset Formula $r:=1+\smash{\frac{1}{n+1}}$
6395 \begin_inset Formula $\smash{O(\log^{2-\epsilon}n)}$
6401 \begin_layout Enumerate
6402 The resulting path has optimal length.
6407 \begin_layout Standard
6420 \begin_layout EndFrame