{"id":9591,"date":"2019-05-06T09:05:28","date_gmt":"2019-05-06T09:05:28","guid":{"rendered":"http:\/\/blog.bachi.net\/?p=9591"},"modified":"2019-06-24T19:46:34","modified_gmt":"2019-06-24T19:46:34","slug":"ftp_theocomp","status":"publish","type":"post","link":"https:\/\/blog.bachi.net\/?p=9591","title":{"rendered":"FTP_TheoComp"},"content":{"rendered":"<p><a href=\"https:\/\/de.wikipedia.org\/wiki\/Komplexit%C3%A4tstheorie\">Komplexit\u00e4tstheorie<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Volker_Strassen\">Volker Strassen<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Strassen-Algorithmus\">Strassen-Algorithmus<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Solovay-Strassen-Test\">Solovay-Strassen-Test<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Additionskette\">Additionskette<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Bin%C3%A4re_Exponentiation\">Bin\u00e4re Exponentiation<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Russische_Bauernmultiplikation\">Russische Bauernmultiplikation<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Determinante\">Determinante<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Permanente\">Permanente<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Permutation\">Permutation<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Permutationsmatrix\">Permutationsmatrix<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Zyklische_Permutation\">Zyklische Permutation -> Vertauschung oder Transposition<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Vorzeichen_(Permutation)\">Vorzeichen (Permutation)<\/a><\/p>\n<h2>Woche 10<\/h2>\n<h4>Wikipedia<\/h4>\n<p><a href=\"https:\/\/de.wikipedia.org\/wiki\/Komplexit%C3%A4tstheorie\">Komplexit\u00e4tstheorie<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Automat_(Informatik)\">Automat (Informatik)<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Landau-Symbole\">Landau-Symbole<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Konjunktive_Normalform\">Konjunktive Normalform<\/a><\/p>\n<h2>Woche 13<\/h2>\n<h4>Tutorial<\/h4>\n<p><a href=\"http:\/\/www.chemgapedia.de\/vsengine\/vlu\/vsc\/de\/ma\/1\/mc\/ma_01\/ma_01_01\/ma_01_01_01.vlu.html\">Aussagen und Logik<\/a> (dann folgt)<\/p>\n<h4>Wikipedia<\/h4>\n<p><a href=\"https:\/\/de.wikipedia.org\/wiki\/Karps_21_NP-vollst%C3%A4ndige_Probleme\">Karps 21 NP-vollst\u00e4ndige Probleme<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Disjunktionsterm\">Disjunktionsterm \/ Klausel<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Literal\">Literal<\/a>, (Wahrheitswerte: true, false)<br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Clique_(Graphentheorie)\">Clique (Graphentheorie)<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Cliquenproblem\">Cliquenproblem<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Knoten%C3%BCberdeckung\">Knoten\u00fcberdeckung<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Knoten%C3%BCberdeckungsproblem\">Knoten\u00fcberdeckungsproblem<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Erf%C3%BCllbarkeitsproblem_der_Aussagenlogik\">Erf\u00fcllbarkeitsproblem der Aussagenlogik (SAT)<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/3-SAT\">3-SAT<\/a><br \/>\n<a href=\"https:\/\/de.wikipedia.org\/wiki\/Teilsummenproblem\">Teilsummenproblem (subset sum problem)<\/a><\/p>\n<h4>YouTube<\/h4>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=zYcvoE_OLx4\">Komplexit\u00e4t #05 &#8211; Polyzeit-Reduktionen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=mr1FMrwi6Ew\">16. Complexity: P, NP, NP-completeness, Reductions<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=TRduEgbZs8Y\">Reductions &#8211; Intro to Theoretical Computer Science<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=DPrcLl9vTFg\">Polynomialzeit-Reduktion<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=qw5ORsQ1o9s\">Vertex Cover (Knoten\u00fcberdeckung)<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=ba6HGbxSg1g\">CSC 333 Reductions from Ham Cycle to TSP and from Vertex Cover to Dominating Set<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=1QeHNctSveU\">NP Completeness for Dummies: Reduction of NP Complete Problems<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=lQM6nyqLtjk\">Reductions and NP-Complete Proofs (CS)<\/a> (Karp Reduction)<\/p>\n<h3>YouTube<\/h3>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=69JVjZXPhHk\">Leibnizformel f\u00fcr Determinanten<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=t40QqRIXLRs\">Zyklendarstellung von Permutationen<\/a><\/p>\n<p><a href=\"https:\/\/www.youtube.com\/watch?v=deDq4a8Vad8\">Die Chomsky-Hierarchie<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLyAYXOZ2UwNypi5lCMgKx-bWUbpstnr1h\">Theoretische Informatik<\/a>, Karsten Morisse (Playlist)<br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=6wS5NztOAK0\">TI_6_6 TM: akzeptieren und entscheiden<\/a>, Karsten Morisse<br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=O0lkCLHp7Wo\">Theoretische Informatik &#8211; Kontextsensitive Sprachen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLNmsVeXQZj7pJpmHG8m8IWQr_t-eqimE_\">Graphen, Grammatiken und Automaten<\/a>, The Morpheus Tutorials (Playlist)<br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLb0zKSynM2PAASKXig6qeAf59YHwKsCLK\">Theoretische Informatik (Wintersemester 2013\/2014)<\/a>, Weitz \/ HAW Hamburg<br \/>\n<a href=\"https:\/\/www.youtube.com\/channel\/UCXnrWGI3Aghtxw43iRpdalQ\/videos?view=0&#038;sort=dd&#038;shelf_id=0\">Tim Roughgarden on Theoretical Computer Science<\/a> (Playlist)<br \/>\n<a href=\"https:\/\/www.youtube.com\/channel\/UCBLr7ISa_YDy5qeATupf26w\/videos?view=0&#038;sort=dd&#038;shelf_id=1\">Algorithms Live!<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/user\/purpongie\/playlists\">WilliamFiset Algorithms<\/a><\/p>\n<h1>B\u00fccher \/ Books<\/h1>\n<p>Diskrete Mathematik erleben, Stephan Hu\u00dfmann, Brigitte Lutz-Westphal, 2015<br \/>\nFundamentals of Discrete Math for Computer Science, Tom Jenkyns, Ben Stephenson, 2018<br \/>\nKonkrete Mathematik (nicht nur) f\u00fcr Informatiker, Edmund Weitz, 2018<br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLb0zKSynM2PBYzz6l37rWH3B_n_7P40QP\">Konkrete Mathematik (nicht nur) f\u00fcr Informatiker<\/a> (Playlist)<\/p>\n<h1>NLogSpace<\/h1>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLG_1tsKrsKVO2ANHX68UbrNgt7gZuH37H\">Formale Sprachen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLG_1tsKrsKVOmNXayMalnfBJaQE5lVBis\">Berechenbarkeit<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLG_1tsKrsKVNVbcjKJ_XnoQ1FKM2KeBj5\">Komplexit\u00e4t<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/watch?v=zW4cepw0J2E\">Entscheidbar, unentscheidbar, semi-entscheidbar?<\/a><\/p>\n<h1>Mathematik-Vorkurs \u2013 Universit\u00e4t des Saarlandes<\/h1>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM5ks6-Kl27WxJQlaFhVoREz\">Kapitel 1 &#8211; Sprachen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM6Bco9su_BTSxPE87-GPrGe\">Kapitel 2.1 &#8211; Aussagenlogik<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM7AWQAKYFn1jBLZ95NazeMb\">Kapitel 2.2 &#8211; Pr\u00e4dikatenlogik<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM4LMuJYCilhqt26i-4ntfE4\">Kapitel 3 &#8211; Schlie\u00dfen und Beweisen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM42zdnGuhCM2Zn5KJyySTbY\">Kapitel 4 &#8211; Mengen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM4zXIZtw9UY7IGKVLoi9-wI\">Kapitel 5 &#8211; Relationen<\/a><br \/>\n<a href=\"https:\/\/www.youtube.com\/playlist?list=PLy6OYAxAoLM5taxUPslGAnQnsXmEk4mB_\">Kapitel 6 &#8211; Induktion<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Komplexit\u00e4tstheorie Volker Strassen Strassen-Algorithmus Solovay-Strassen-Test Additionskette Bin\u00e4re Exponentiation Russische Bauernmultiplikation Determinante Permanente Permutation Permutationsmatrix Zyklische Permutation -> Vertauschung oder Transposition Vorzeichen (Permutation) Woche 10 Wikipedia Komplexit\u00e4tstheorie Automat (Informatik) Landau-Symbole Konjunktive Normalform Woche 13 Tutorial Aussagen und Logik (dann folgt) Wikipedia Karps 21 NP-vollst\u00e4ndige Probleme Disjunktionsterm \/ Klausel Literal, (Wahrheitswerte: true, false) Clique (Graphentheorie) Cliquenproblem Knoten\u00fcberdeckung [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-9591","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/9591","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=9591"}],"version-history":[{"count":27,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/9591\/revisions"}],"predecessor-version":[{"id":9737,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/9591\/revisions\/9737"}],"wp:attachment":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=9591"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=9591"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=9591"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}