...

kfriedberger · Jun 5, 2018 · 5dd6b15 · 5dd6b15
1 parent e0c2f34
commit 5dd6b15
Show file tree

Hide file tree

Showing 6 changed files with 3 additions and 8 deletions.
diff --git a/MaxSAT/main.tex b/MaxSAT/main.tex
diff --git a/MaxSAT/main_RU.tex b/MaxSAT/main_RU.tex
diff --git a/MaxSMT/main.tex b/MaxSMT/main.tex
@@ -1,6 +1,6 @@
 \section{MaxSMT}
 
-TODO write something
+%TODO write something
 
 % subsections:
 \input{MaxSMT/set_cover/main_EN}

diff --git a/MaxSAT/main_EN.tex → basics/SAT/MaxSAT.tex b/MaxSAT/main_EN.tex → basics/SAT/MaxSAT.tex
@@ -1,4 +1,4 @@
-\section{MaxSAT}
+\subsubsection{MaxSAT}
 
 MaxSAT problem is a problem where as many clauses should be satisfied, as possible, but maybe not all.
 

diff --git a/basics/SAT/main.tex b/basics/SAT/main.tex
@@ -300,5 +300,6 @@ \subsubsection{Picosat}
 \end{lstlisting}
 
 % subsubsections:
+\input{\CURPATH/MaxSAT}
 \input{\CURPATH/list_EN}
 
diff --git a/main.tex b/main.tex
@@ -153,7 +153,6 @@
 \input{symbolic/main}
 \input{KLEE/main}
 \input{crypto/main}
-\input{MaxSAT/main}
 \input{FOL/main}
 \input{CA/main}
 \input{other/main}