Whitespace cosmetics

[lyx.git] / lib / examples / beamerlyxexample1.lyx

diff --git a/lib/examples/beamerlyxexample1.lyx b/lib/examples/beamerlyxexample1.lyx
index 85e0af7f60ab5b7dbd655dcd417b8164c69e41ed..0a6e9c2e133f63eed323fbfb0de696b1d478d263 100644 (file)
--- a/lib/examples/beamerlyxexample1.lyx
+++ b/lib/examples/beamerlyxexample1.lyx
@@ -1,5 +1,5 @@
-#LyX 2.2 created this file. For more info see http://www.lyx.org/
-\lyxformat 508
+#LyX 2.3 created this file. For more info see http://www.lyx.org/
+\lyxformat 544
 \begin_document
 \begin_header
 \save_transient_properties true
@@ -157,9 +157,9 @@
 \language_package default
 \inputencoding auto
 \fontencoding global
-\font_roman "times" "default"
-\font_sans "default" "default"
-\font_typewriter "default" "default"
+\font_roman "lmodern" "default"
+\font_sans "lmss" "default"
+\font_typewriter "lmtt" "default"
 \font_math "auto" "auto"
 \font_default_family default
 \use_non_tex_fonts false
@@ -167,6 +167,8 @@
 \font_osf false
 \font_sf_scale 100 100
 \font_tt_scale 100 100
+\use_microtype false
+\use_dash_ligatures false
 \graphics default
 \default_output_format default
 \output_sync 0
@@ -176,7 +178,7 @@
 \spacing single
 \use_hyperref false
 \papersize default
-\use_geometry false
+\use_geometry true
 \use_package amsmath 2
 \use_package amssymb 2
 \use_package cancel 0
@@ -196,6 +198,7 @@
 \suppress_date false
 \justification true
 \use_refstyle 0
+\use_minted 0
 \index Index
 \shortcut idx
 \color #008000
@@ -204,7 +207,10 @@
 \tocdepth 2
 \paragraph_separation indent
 \paragraph_indentation default
-\quotes_language english
+\is_math_indent 0
+\math_numbering_side default
+\quotes_style english
+\dynamic_quotes 0
 \papercolumns 1
 \papersides 1
 \paperpagestyle default
@@ -262,10 +268,6 @@ Outline
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -366,17 +368,10 @@ Tournaments Consist of Jousts Between Knights
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
-\begin_inset Separator latexpar
-\end_inset
-
 
 \end_layout
 
@@ -566,10 +561,6 @@ What is a Tournament?
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -616,7 +607,7 @@ In every joust one knight wins.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -633,17 +624,10 @@ Tournaments are Complete Directed Graphs
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
-\begin_inset Separator latexpar
-\end_inset
-
 
 \end_layout
 
@@ -871,10 +855,6 @@ tournament
  
 \color inherit
 is a
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -894,7 +874,7 @@ any two different vertices.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -921,10 +901,6 @@ Tournaments Arise Naturally in Different Situations
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -939,10 +915,6 @@ Applications in Ordering Theory
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -957,7 +929,7 @@ The comparison relation may be cyclic, however.
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -974,10 +946,6 @@ Applications in Sociology
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -992,7 +960,7 @@ Reviewers decide for any two candidates whom they prefer.
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -1009,10 +977,6 @@ Applications in Structural Complexity Theory
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1053,10 +1017,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1193,10 +1153,6 @@ the Approximation Problem
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1333,10 +1289,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1351,10 +1303,6 @@ t,onlytextwidth
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1428,10 +1376,6 @@ Example Input
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -1821,10 +1765,6 @@ Example Output
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2051,10 +1991,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2069,10 +2005,6 @@ Variants of Path Finding Problems
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2288,10 +2220,6 @@ Logspace Turing Machines
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2460,7 +2388,7 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -2477,10 +2405,6 @@ Logspace Turing Machines Are Quite Powerful
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2495,10 +2419,6 @@ Deterministic logspace machines can compute
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2530,10 +2450,6 @@ Non-deterministic logspace machines can compute
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2552,7 +2468,7 @@ satisfiability with two literals per clause.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -2589,10 +2505,6 @@ The Complexity Class Hierarchy
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -2981,7 +2893,7 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3014,10 +2926,6 @@ Limit the Circuit Depth
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3057,10 +2965,6 @@ t
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3083,10 +2987,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3103,9 +3003,6 @@ unbounded fan-in
 
 \end_deeper
 \begin_layout Examples
-\begin_inset Separator latexpar
-\end_inset
-
 
 \end_layout
 
@@ -3148,10 +3045,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3168,9 +3061,6 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
-\begin_inset Separator latexpar
-\end_inset
-
 
 \end_layout
 
@@ -3220,10 +3110,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3240,9 +3126,6 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
-\begin_inset Separator latexpar
-\end_inset
-
 
 \end_layout
 
@@ -3289,10 +3172,6 @@ Are Equally Difficult
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3318,10 +3197,6 @@ Are Equally Difficult
 
 \begin_layout Corollary
 For directed graphs, we can solve
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3387,10 +3262,6 @@ But Not Trivial
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3410,7 +3281,7 @@ But Not Trivial
 \end_layout
 
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3464,10 +3335,6 @@ Definition of the Tournament Reachability Problem
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3489,10 +3356,6 @@ contain all triples
 \end_inset
 
  such that
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3526,7 +3389,7 @@ there exists a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3543,10 +3406,6 @@ The Tournament Reachability Problem is Very Easy
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3572,10 +3431,6 @@ Implications
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3640,10 +3495,6 @@ the Distance Problem
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3665,10 +3516,6 @@ contain all tuples
 \end_inset
 
  such that 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3706,7 +3553,7 @@ the distance of
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3723,10 +3570,6 @@ The Tournament Distance Problem is Hard
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3792,7 +3635,7 @@ in logarithmic space, iff
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3813,10 +3656,6 @@ Proof That
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3847,10 +3686,6 @@ t,onlytextwidth
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3895,10 +3730,6 @@ Reduce
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -3967,7 +3798,7 @@ Query:
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -3994,10 +3825,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5153,10 +4980,6 @@ Approximators Compute Paths that Are Nearly As Short As a Shortest Path
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5174,10 +4997,6 @@ approximation scheme for
  
 \color inherit
 gets as input
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5224,7 +5043,7 @@ a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5245,10 +5064,6 @@ the Tournament Shortest Path Problem
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5354,10 +5169,6 @@ Just a frame with a program code listing
 
 \begin_layout FragileFrame
 This is some program code:
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5437,10 +5248,6 @@ Summary
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5455,10 +5262,6 @@ Summary
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5529,7 +5332,7 @@ in tournaments is
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5546,10 +5349,6 @@ Outlook
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5624,10 +5423,6 @@ For Further Reading
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5651,6 +5446,7 @@ beamertemplatebookbibitems
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "Moon1968"
+literal "true"
 
 \end_inset
 
@@ -5711,6 +5507,7 @@ beamertemplatearticlebibitems
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "NickelsenT2002"
+literal "true"
 
 \end_inset
 
@@ -5757,6 +5554,7 @@ Proc.
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "Tantau2004b"
+literal "true"
 
 \end_inset
 
@@ -5860,10 +5658,6 @@ Definition of Independence Number of a Graph
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5898,7 +5692,7 @@ Tournaments have independence number 1.
 
 \end_deeper
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5919,10 +5713,6 @@ Graphs With Bounded Independence Number
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -5963,7 +5753,7 @@ at most
 \end_layout
 
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -5999,7 +5789,7 @@ for approximating the shortest path in graphs with independence number at
 \end_layout
 
 \begin_layout Standard
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
 
@@ -6083,10 +5873,6 @@ Is Party Unknown.
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -6103,10 +5889,6 @@ Is Party Unknown.
 
 \begin_layout Corollary
 For undirected graphs, we can solve
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -6242,10 +6024,6 @@ The Approximation Scheme is Optimal
 \end_inset
 
 
-\begin_inset Separator latexpar
-\end_inset
-
-
 \end_layout
 
 \begin_deeper
@@ -6267,9 +6045,6 @@ Suppose there exists an approximation scheme for
 \end_layout
 
 \begin_layout Proof
-\begin_inset Separator latexpar
-\end_inset
-
 
 \end_layout