French UserGuide.lyx: another update from Jean-Pierre

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

diff --git a/lib/examples/beamerlyxexample1.lyx b/lib/examples/beamerlyxexample1.lyx
index aaff49bcc8ae05a2ba8f7a9854dfa4b7601c20d7..f595947dedf296f3aa5be2cead5cf40a4ac6c3f2 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 503
+\lyxformat 506
 \begin_document
 \begin_header
+\save_transient_properties true
 \origin /systemlyxdir/examples/
 \textclass beamer
 \begin_preamble
@@ -264,6 +265,7 @@ Outline
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -367,14 +369,15 @@ Tournaments Consist of Jousts Between Knights
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
-
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -566,6 +569,7 @@ What is a Tournament?
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -612,12 +616,11 @@ In every joust one knight wins.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -633,14 +636,15 @@ Tournaments are Complete Directed Graphs
 \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 +871,10 @@ tournament
  
 \color inherit
 is a
-\color inherit
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -890,12 +894,11 @@ any two different vertices.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 2
@@ -921,6 +924,7 @@ Tournaments Arise Naturally in Different Situations
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -938,6 +942,7 @@ Applications in Ordering Theory
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -952,12 +957,11 @@ The comparison relation may be cyclic, however.
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout ExampleBlock
 \begin_inset Argument 2
@@ -973,6 +977,7 @@ Applications in Sociology
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -987,12 +992,11 @@ Reviewers decide for any two candidates whom they prefer.
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout ExampleBlock
 \begin_inset Argument 2
@@ -1008,6 +1012,7 @@ Applications in Structural Complexity Theory
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -1051,6 +1056,7 @@ status open
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -1190,6 +1196,7 @@ the Approximation Problem
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -1329,6 +1336,7 @@ status open
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -1346,6 +1354,7 @@ t,onlytextwidth
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -1422,6 +1431,7 @@ Example Input
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -1814,6 +1824,7 @@ Example Output
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2043,6 +2054,7 @@ status open
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2060,6 +2072,7 @@ Variants of Path Finding Problems
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2278,6 +2291,7 @@ Logspace Turing Machines
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2446,12 +2460,11 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -2467,6 +2480,7 @@ Logspace Turing Machines Are Quite Powerful
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2484,6 +2498,7 @@ Deterministic logspace machines can compute
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2518,6 +2533,7 @@ Non-deterministic logspace machines can compute
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2536,12 +2552,11 @@ satisfiability with two literals per clause.
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 1
@@ -2577,6 +2592,7 @@ The Complexity Class Hierarchy
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -2965,12 +2981,11 @@ end{pgfpicture}
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3002,6 +3017,7 @@ Limit the Circuit Depth
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3044,6 +3060,7 @@ t
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3069,6 +3086,7 @@ Circuit Class
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3085,10 +3103,10 @@ unbounded fan-in
 
 \end_deeper
 \begin_layout Examples
-
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3133,6 +3151,7 @@ Circuit Class
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3149,10 +3168,10 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
-
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3204,6 +3223,7 @@ Circuit Class
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3220,10 +3240,10 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
-
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3272,6 +3292,7 @@ Are Equally Difficult
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3300,6 +3321,7 @@ For directed graphs, we can solve
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3368,6 +3390,7 @@ But Not Trivial
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3387,12 +3410,11 @@ But Not Trivial
 \end_layout
 
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Fact
 \begin_inset Formula $\Lang{reach}_{\operatorname{path}}$
@@ -3445,6 +3467,7 @@ Definition of the Tournament Reachability Problem
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3466,10 +3489,10 @@ contain all triples
 \end_inset
 
  such that
-\color inherit
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3503,12 +3526,11 @@ there exists a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3524,6 +3546,7 @@ The Tournament Reachability Problem is Very Easy
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3552,6 +3575,7 @@ Implications
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3619,6 +3643,7 @@ the Distance Problem
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3640,10 +3665,10 @@ contain all tuples
 \end_inset
 
  such that 
-\color inherit
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3681,12 +3706,11 @@ the distance of
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3702,6 +3726,7 @@ The Tournament Distance Problem is Hard
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3767,12 +3792,11 @@ in logarithmic space, iff
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -3792,6 +3816,7 @@ Proof That
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3825,6 +3850,7 @@ t,onlytextwidth
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3872,6 +3898,7 @@ Reduce
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -3940,12 +3967,11 @@ Query:
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Block
 \begin_inset Argument 2
@@ -3971,6 +3997,7 @@ status open
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5129,6 +5156,7 @@ Approximators Compute Paths that Are Nearly As Short As a Shortest Path
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5146,10 +5174,10 @@ approximation scheme for
  
 \color inherit
 gets as input
-\color inherit
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5196,12 +5224,11 @@ a path from
 \end_deeper
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -5221,6 +5248,7 @@ the Tournament Shortest Path Problem
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5302,7 +5330,7 @@ fragile
 \end_inset
 
 .
- \SpecialCharNoPassThru LyX
+ \SpecialChar LyX
  has the FragileFrame layout for this.
 \end_layout
 
@@ -5329,6 +5357,7 @@ This is some program code:
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5411,6 +5440,7 @@ Summary
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5428,6 +5458,7 @@ Summary
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5498,12 +5529,11 @@ in tournaments is
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Block
 \begin_inset Argument 2
@@ -5519,6 +5549,7 @@ Outlook
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5596,6 +5627,7 @@ For Further Reading
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5831,6 +5863,7 @@ Definition of Independence Number of a Graph
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5865,12 +5898,11 @@ Tournaments have independence number 1.
 
 \end_deeper
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Frame
 \begin_inset Argument 4
@@ -5890,6 +5922,7 @@ Graphs With Bounded Independence Number
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -5930,12 +5963,11 @@ at most
 \end_layout
 
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Theorem
 For each
@@ -5967,12 +5999,11 @@ for approximating the shortest path in graphs with independence number at
 \end_layout
 
 \begin_layout Standard
-
 \begin_inset Separator parbreak
 \end_inset
 
-\end_layout
 
+\end_layout
 
 \begin_layout Theorem
 For each
@@ -6055,6 +6086,7 @@ Is Party Unknown.
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -6074,6 +6106,7 @@ For undirected graphs, we can solve
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -6212,6 +6245,7 @@ The Approximation Scheme is Optimal
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper
@@ -6233,10 +6267,10 @@ Suppose there exists an approximation scheme for
 \end_layout
 
 \begin_layout Proof
-
 \begin_inset Separator parbreak
 \end_inset
 
+
 \end_layout
 
 \begin_deeper