-
Notifications
You must be signed in to change notification settings - Fork 0
/
ukazka_prace1.bbl
72 lines (58 loc) · 2 KB
/
ukazka_prace1.bbl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
\begin{thebibliography}{10}
\bibitem{Threshold}
{\sc Chertkov, E.}
\newblock Phase transitions in random satisfiability problems.
\newblock
\url{http://guava.physics.uiuc.edu/~nigel/courses/563/Essays_2017/PDF/chertkov.pdf},
2017.
\bibitem{unsatisfiable}
{\sc Coja-Oghlan, A.}
\newblock Chasing the k-sat threshold.
\newblock
\url{https://www.math.uni-frankfurt.de/~acoghlan/talk_AtlantaSAT.pdf}, 2017.
\bibitem{cook}
{\sc Cook, S.~A.}
\newblock {\em The Complexity of Theorem-Proving Procedures}.
\newblock Proceedings of the Third Annual ACM Symposium on Theory of Computing,
1971.
\bibitem{satcomp}
{\sc Heule, M., Jarvisalo, M., and Suda, M.}
\newblock Sat competition.
\newblock \url{http://sat2018.forsyte.tuwien.ac.at/}.
\bibitem{satdef}
{\sc HURTH, M., R.~M.}
\newblock {\em Logic in computer science}, 2~ed.
\newblock Cambridge University Press, New York, 2004.
\newblock ISBN 978-0-511-26401-6.
\bibitem{jahobp}
{\sc Jahodka, D.}
\newblock {\em Heuristické riešenie MRHS rovníc}.
\newblock 2018.
\bibitem{fikobp}
{\sc Kabashi, F.}
\newblock {\em Aplikácia MRHS rovníc na riešenie SAT problému}.
\newblock 2018.
\bibitem{cnfgen}
{\sc Lauria, M.}
\newblock Cnfgen.
\newblock \url{https://github.com/MassimoLauria/cnfgen}.
\bibitem{mrhslingebra}
{\sc Raddum, H., and Zajac, P.}
\newblock Mrhs solver based on linear algebra and exhaustive search.
\newblock https://eprint.iacr.org/2018/111.pdf.
\bibitem{Threshold2}
{\sc Stephan~Mertens, Marck~Mézard, R.~Z.}
\newblock Threshold values of random k-sat from the cavity method.
\newblock \url{https://arxiv.org/pdf/cs/0309020.pdf}, 2017.
\bibitem{bip}
{\sc Wikipedia}.
\newblock Bipartitný graf.
\newblock \url{https://en.wikipedia.org/wiki/Bipartite_graph}.
\bibitem{subsetsum}
{\sc Wikipedia}.
\newblock Subset sum problem.
\newblock \url{https://en.wikipedia.org/wiki/Subset_sum_problem}.
\bibitem{dualspacesolver}
{\sc Zajac, P., Bednáriková, A., Jahodka, D., and Kabashi, F.}
\newblock Solving mrhs systems generated from k-sat instances.
\end{thebibliography}