Whitespace cosmetics

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

diff --git a/lib/examples/beamerlyxexample1.lyx b/lib/examples/beamerlyxexample1.lyx
index 557a4fb851c7cfb8df5eda09d7c438bb7f52c212..0a6e9c2e133f63eed323fbfb0de696b1d478d263 100644 (file)
--- a/lib/examples/beamerlyxexample1.lyx
+++ b/lib/examples/beamerlyxexample1.lyx
@@ -1,7 +1,8 @@
-#LyX 2.2 created this file. For more info see http://www.lyx.org/
-\lyxformat 501
+#LyX 2.3 created this file. For more info see http://www.lyx.org/
+\lyxformat 544
 \begin_document
 \begin_header
+\save_transient_properties true
 \origin /systemlyxdir/examples/
 \textclass beamer
 \begin_preamble
@@ -156,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
@@ -166,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
@@ -175,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
@@ -195,6 +198,7 @@
 \suppress_date false
 \justification true
 \use_refstyle 0
+\use_minted 0
 \index Index
 \shortcut idx
 \color #008000
@@ -203,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
@@ -261,9 +268,6 @@ Outline
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -364,17 +368,11 @@ Tournaments Consist of Jousts Between Knights
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -563,9 +561,6 @@ What is a Tournament?
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -612,12 +607,11 @@ In every joust one knight wins.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -630,17 +624,11 @@ Tournaments are Complete Directed Graphs
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -867,10 +855,6 @@ tournament
  
 \color inherit
 is a
-\color inherit
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -890,12 +874,11 @@ any two different vertices.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 2
@@ -918,9 +901,6 @@ Tournaments Arise Naturally in Different Situations
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -935,9 +915,6 @@ Applications in Ordering Theory
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -952,12 +929,11 @@ The comparison relation may be cyclic, however.
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout ExampleBlock
 \begin_inset Argument 2
@@ -970,9 +946,6 @@ Applications in Sociology
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -987,12 +960,11 @@ Reviewers decide for any two candidates whom they prefer.
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout ExampleBlock
 \begin_inset Argument 2
@@ -1005,9 +977,6 @@ Applications in Structural Complexity Theory
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -1048,9 +1017,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -1187,9 +1153,6 @@ the Approximation Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -1326,9 +1289,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -1343,9 +1303,6 @@ t,onlytextwidth
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -1419,9 +1376,6 @@ Example Input
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -1811,9 +1765,6 @@ Example Output
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2040,9 +1991,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2057,9 +2005,6 @@ Variants of Path Finding Problems
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2275,9 +2220,6 @@ Logspace Turing Machines
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2446,12 +2388,11 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -2464,9 +2405,6 @@ Logspace Turing Machines Are Quite Powerful
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2481,9 +2419,6 @@ Deterministic logspace machines can compute
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2515,9 +2450,6 @@ Non-deterministic logspace machines can compute
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2536,12 +2468,11 @@ satisfiability with two literals per clause.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 1
@@ -2574,9 +2505,6 @@ The Complexity Class Hierarchy
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -2965,12 +2893,11 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -2999,9 +2926,6 @@ Limit the Circuit Depth
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3041,9 +2965,6 @@ t
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3066,9 +2987,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3086,9 +3004,6 @@ unbounded fan-in
 \end_deeper
 \begin_layout Examples
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3130,9 +3045,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3150,9 +3062,6 @@ bounded fan-in
 \end_deeper
 \begin_layout Examples
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3201,9 +3110,6 @@ Circuit Class
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3221,9 +3127,6 @@ bounded fan-in
 \end_deeper
 \begin_layout Examples
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3269,9 +3172,6 @@ Are Equally Difficult
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3297,9 +3197,6 @@ Are Equally Difficult
 
 \begin_layout Corollary
 For directed graphs, we can solve
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3365,9 +3262,6 @@ But Not Trivial
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3387,12 +3281,11 @@ But Not Trivial
 \end_layout
 
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Fact
 \begin_inset Formula $\Lang{reach}_{\operatorname{path}}$
@@ -3442,9 +3335,6 @@ Definition of the Tournament Reachability Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3466,10 +3356,6 @@ contain all triples
 \end_inset
 
  such that
-\color inherit
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3503,12 +3389,11 @@ there exists a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3521,9 +3406,6 @@ The Tournament Reachability Problem is Very Easy
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3549,9 +3431,6 @@ Implications
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3616,9 +3495,6 @@ the Distance Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3640,10 +3516,6 @@ contain all tuples
 \end_inset
 
  such that 
-\color inherit
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3681,12 +3553,11 @@ the distance of
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3699,9 +3570,6 @@ The Tournament Distance Problem is Hard
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3767,12 +3635,11 @@ in logarithmic space, iff
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3789,9 +3656,6 @@ Proof That
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3822,9 +3686,6 @@ t,onlytextwidth
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3869,9 +3730,6 @@ Reduce
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -3940,12 +3798,11 @@ Query:
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Block
 \begin_inset Argument 2
@@ -3968,9 +3825,6 @@ status open
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5126,9 +4980,6 @@ Approximators Compute Paths that Are Nearly As Short As a Shortest Path
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5146,10 +4997,6 @@ approximation scheme for
  
 \color inherit
 gets as input
-\color inherit
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5196,12 +5043,11 @@ a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -5218,9 +5064,6 @@ the Tournament Shortest Path Problem
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5302,7 +5145,7 @@ fragile
 \end_inset
 
 .
- \SpecialCharNoPassThru LyX
+ \SpecialChar LyX
  has the FragileFrame layout for this.
 \end_layout
 
@@ -5326,9 +5169,6 @@ Just a frame with a program code listing
 
 \begin_layout FragileFrame
 This is some program code:
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5408,9 +5248,6 @@ Summary
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5425,9 +5262,6 @@ Summary
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5498,12 +5332,11 @@ in tournaments is
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Block
 \begin_inset Argument 2
@@ -5516,9 +5349,6 @@ Outlook
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5593,9 +5423,6 @@ For Further Reading
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5619,6 +5446,7 @@ beamertemplatebookbibitems
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "Moon1968"
+literal "true"
 
 \end_inset
 
@@ -5679,6 +5507,7 @@ beamertemplatearticlebibitems
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "NickelsenT2002"
+literal "true"
 
 \end_inset
 
@@ -5725,6 +5554,7 @@ Proc.
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
 key "Tantau2004b"
+literal "true"
 
 \end_inset
 
@@ -5828,9 +5658,6 @@ Definition of Independence Number of a Graph
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5865,12 +5692,11 @@ Tournaments have independence number 1.
 
 \end_deeper
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -5887,9 +5713,6 @@ Graphs With Bounded Independence Number
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -5930,12 +5753,11 @@ at most
 \end_layout
 
 \begin_layout Standard
-
-\begin_inset Separator parbreak
+\begin_inset Separator plain
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Theorem
 For each
@@ -5967,12 +5789,11 @@ 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
 
-\end_layout
 
+\end_layout
 
 \begin_layout Theorem
 For each
@@ -6052,9 +5873,6 @@ Is Party Unknown.
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -6071,9 +5889,6 @@ Is Party Unknown.
 
 \begin_layout Corollary
 For undirected graphs, we can solve
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -6209,9 +6024,6 @@ The Approximation Scheme is Optimal
 \end_inset
 
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper
@@ -6234,9 +6046,6 @@ Suppose there exists an approximation scheme for
 
 \begin_layout Proof
 
-\begin_inset Separator parbreak
-\end_inset
-
 \end_layout
 
 \begin_deeper