<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/concept/tag/Complexity"><title>BibSonomy bookmarks for /concept/tag/Complexity</title><link>https://www.bibsonomy.org/concept/tag/Complexity</link><description>BibSonomy RSS Feed for /concept/tag/Complexity</description><items><rdf:Seq><rdf:li rdf:resource="https://arxiv.org/abs/2411.19713"/><rdf:li rdf:resource="https://itrevolution.com/how-to-wardley-map/"/><rdf:li rdf:resource="https://link.springer.com/book/9783031063329"/><rdf:li rdf:resource="https://www.neilmosley.com/blog/data-and-learning-does-more-information-better-results"/><rdf:li rdf:resource="https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.2.023219"/><rdf:li rdf:resource="https://arxiv.org/abs/1608.06580"/><rdf:li rdf:resource="https://hackernoon.com/warm-data-9f0fcd2a828c"/><rdf:li rdf:resource="https://journals.uic.edu/ojs/index.php/fm/article/view/6102"/><rdf:li rdf:resource="https://www.academia.edu/8703548/The_Natural_Design_Movement_Design_for_Human_and_Planetary_Health_A_Holistic_Integral_Approach_to_Complexity_and_Sustainability_Daniel_C_Wahl_2006_PhD_Thesis_University_of_Dundee_Chapter_3"/><rdf:li rdf:resource="https://www.sketchplanations.com/post/617124694626369536/the-law-of-unintended-consequences-people-are"/><rdf:li rdf:resource="https://www.pmi.org/learning/library/next-generation-project-management-6093"/><rdf:li rdf:resource="https://williamdurand.fr/2014/02/14/please-do-not-patch-like-an-idiot/"/><rdf:li rdf:resource="https://people.eecs.berkeley.edu/~jordan/courses.html"/><rdf:li rdf:resource="https://www.tandfonline.com/doi/abs/10.1080/07294360.2019.1677569?journalCode=cher20"/><rdf:li rdf:resource="https://lucatrevisan.github.io/"/><rdf:li rdf:resource="https://lucatrevisan.wordpress.com/lecture-notes/"/><rdf:li rdf:resource="https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-055j-the-art-of-approximation-in-science-and-engineering-spring-2008/readings/"/><rdf:li rdf:resource="https://courses.cs.washington.edu/courses/cse599s/19wi/"/><rdf:li rdf:resource="http://math.bu.edu/people/mkon/talkdag2.pdf"/><rdf:li rdf:resource="http://math.bu.edu/people/mkon/FOCM05Talkn2.pdf"/></rdf:Seq></items></channel><item rdf:about="https://arxiv.org/abs/2411.19713"><title>[2411.19713] CantorNet: A Sandbox for Testing Geometrical and Topological Complexity Measures</title><description>Abstract page for arXiv paper 2411.19713: CantorNet: A Sandbox for Testing Geometrical and Topological Complexity Measures</description><link>https://arxiv.org/abs/2411.19713</link><dc:creator>scch</dc:creator><dc:date>2025-06-19T16:24:27+02:00</dc:date><dc:subject>Testing Topological Measures Geometrical Complexity </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Abstract page for arXiv paper 2411.19713: CantorNet: A Sandbox for Testing Geometrical and Topological Complexity Measures&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Testing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Topological"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Measures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Geometrical"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Complexity"/></rdf:Bag></taxo:topics></item><item rdf:about="https://itrevolution.com/how-to-wardley-map/"><title>How to Wardley Map - IT Revolution</title><description></description><link>https://itrevolution.com/how-to-wardley-map/</link><dc:creator>brightbyte</dc:creator><dc:date>2022-10-13T16:15:18+02:00</dc:date><dc:subject>overview planning complexity wardley management ddiagram map </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-10-13T16:15:18+02:00&#034; href=&#034;https://itrevolution.com/how-to-wardley-map/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://itrevolution.com/how-to-wardley-map/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/overview"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/planning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wardley"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/management"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ddiagram"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/map"/></rdf:Bag></taxo:topics></item><item rdf:about="https://link.springer.com/book/9783031063329"><title>Social and Emotional Learning and Complex skills Assessment | SpringerLink</title><description>The book aims at advancing the research on Social and Emotional Learning (SEL) skills and the role of learning analytics in developing approaches.</description><link>https://link.springer.com/book/9783031063329</link><dc:creator>ereidt</dc:creator><dc:date>2022-05-01T09:41:53+02:00</dc:date><dc:subject>emotionallearning assessment complexity sociallearning book SEL learninganalytics skillsdevelopment research </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The book aims at advancing the research on Social and Emotional Learning (SEL) skills and the role of learning analytics in developing approaches.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/emotionallearning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/assessment"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sociallearning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/SEL"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learninganalytics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/skillsdevelopment"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.neilmosley.com/blog/data-and-learning-does-more-information-better-results"><title>Data and learning: Does more = better?</title><description>Blogpost by Neil Mosley</description><link>https://www.neilmosley.com/blog/data-and-learning-does-more-information-better-results</link><dc:creator>ereidt</dc:creator><dc:date>2022-03-26T12:38:47+01:00</dc:date><dc:subject>potentials complexity edtech evidence digitalisation data learninganalytics learning teaching transformation </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Blogpost by Neil Mosley&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/potentials"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/edtech"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/evidence"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/digitalisation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learninganalytics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/teaching"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transformation"/></rdf:Bag></taxo:topics></item><item rdf:about="https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.2.023219"><title>Phys. Rev. Research 2, 023219 (2020) - General anesthesia reduces complexity and temporal asymmetry of the informational structures derived from neural recordings in Drosophila</title><description></description><link>https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.2.023219</link><dc:creator>bshanks</dc:creator><dc:date>2021-11-21T02:13:29+01:00</dc:date><dc:subject>complexity symmetry aware fly arrow consciousness correlation awake time asymmetry anesthesia </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-11-21T02:13:29+01:00&#034; href=&#034;https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.2.023219&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://journals.aps.org/prresearch/abstract/10.1103/PhysRevResearch.2.023219&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/symmetry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/aware"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fly"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/arrow"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/consciousness"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/correlation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/awake"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/time"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/asymmetry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/anesthesia"/></rdf:Bag></taxo:topics></item><item rdf:about="https://arxiv.org/abs/1608.06580"><title>[1608.06580] Communication complexity of approximate Nash equilibria</title><description></description><link>https://arxiv.org/abs/1608.06580</link><dc:creator>bshanks</dc:creator><dc:date>2021-07-05T01:57:30+02:00</dc:date><dc:subject>complexity gametheory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-07-05T01:57:30+02:00&#034; href=&#034;https://arxiv.org/abs/1608.06580&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://arxiv.org/abs/1608.06580&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gametheory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://hackernoon.com/warm-data-9f0fcd2a828c"><title>Warm Data</title><description></description><link>https://hackernoon.com/warm-data-9f0fcd2a828c</link><dc:creator>schmidt2</dc:creator><dc:date>2020-10-20T01:16:19+02:00</dc:date><dc:subject>complexity warm_data nora_bateson hackernoon international_bateson_institute </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-10-20T01:16:19+02:00&#034; href=&#034;https://hackernoon.com/warm-data-9f0fcd2a828c&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://hackernoon.com/warm-data-9f0fcd2a828c&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/warm_data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nora_bateson"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hackernoon"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/international_bateson_institute"/></rdf:Bag></taxo:topics></item><item rdf:about="https://journals.uic.edu/ojs/index.php/fm/article/view/6102"><title>Tackling complexity in an interdisciplinary scholarly network: Requirements for semantic publishing | First Monday</title><description></description><link>https://journals.uic.edu/ojs/index.php/fm/article/view/6102</link><dc:creator>blostben</dc:creator><dc:date>2020-09-24T12:38:53+02:00</dc:date><dc:subject>wissenschaftliche_Kommunikation complexity Komplexität scholarly-communication </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-09-24T12:38:53+02:00&#034; href=&#034;https://journals.uic.edu/ojs/index.php/fm/article/view/6102&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://journals.uic.edu/ojs/index.php/fm/article/view/6102&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wissenschaftliche_Kommunikation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Komplexität"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scholarly-communication"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.academia.edu/8703548/The_Natural_Design_Movement_Design_for_Human_and_Planetary_Health_A_Holistic_Integral_Approach_to_Complexity_and_Sustainability_Daniel_C_Wahl_2006_PhD_Thesis_University_of_Dundee_Chapter_3"><title>(PDF) The Natural Design Movement; Design for Human and Planetary Health - A Holistic Integral Approach to Complexity and Sustainability, Daniel C. Wahl, 2006 (PhD Thesis), University of Dundee, Chapter 3 | Daniel Christian Wahl, PhD - Academia.edu</title><description></description><link>https://www.academia.edu/8703548/The_Natural_Design_Movement_Design_for_Human_and_Planetary_Health_A_Holistic_Integral_Approach_to_Complexity_and_Sustainability_Daniel_C_Wahl_2006_PhD_Thesis_University_of_Dundee_Chapter_3</link><dc:creator>schmidt2</dc:creator><dc:date>2020-08-05T01:57:22+02:00</dc:date><dc:subject>reference complexity daniel_christian_wahl regenerative sustainability transition </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-08-05T01:57:22+02:00&#034; href=&#034;https://www.academia.edu/8703548/The_Natural_Design_Movement_Design_for_Human_and_Planetary_Health_A_Holistic_Integral_Approach_to_Complexity_and_Sustainability_Daniel_C_Wahl_2006_PhD_Thesis_University_of_Dundee_Chapter_3&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.academia.edu/8703548/The_Natural_Design_Movement_Design_for_Human_and_Planetary_Health_A_Holistic_Integral_Approach_to_Complexity_and_Sustainability_Daniel_C_Wahl_2006_PhD_Thesis_University_of_Dundee_Chapter_3&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reference"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/daniel_christian_wahl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/regenerative"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sustainability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/transition"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.sketchplanations.com/post/617124694626369536/the-law-of-unintended-consequences-people-are"><title>The Law of unintended consequences</title><description></description><link>https://www.sketchplanations.com/post/617124694626369536/the-law-of-unintended-consequences-people-are</link><dc:creator>schmidt2</dc:creator><dc:date>2020-06-14T00:42:50+02:00</dc:date><dc:subject>reference complexity explainer comic </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-06-14T00:42:50+02:00&#034; href=&#034;https://www.sketchplanations.com/post/617124694626369536/the-law-of-unintended-consequences-people-are&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.sketchplanations.com/post/617124694626369536/the-law-of-unintended-consequences-people-are&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reference"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/explainer"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/comic"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.pmi.org/learning/library/next-generation-project-management-6093"><title>What&#039;s the next generation of project management?</title><description></description><link>https://www.pmi.org/learning/library/next-generation-project-management-6093</link><dc:creator>paolodema</dc:creator><dc:date>2020-02-10T13:38:24+01:00</dc:date><dc:subject>complexity projectManagement </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-02-10T13:38:24+01:00&#034; href=&#034;https://www.pmi.org/learning/library/next-generation-project-management-6093&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.pmi.org/learning/library/next-generation-project-management-6093&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/projectManagement"/></rdf:Bag></taxo:topics></item><item rdf:about="https://williamdurand.fr/2014/02/14/please-do-not-patch-like-an-idiot/"><title>Please. Don’t Patch Like That. | William Durand</title><description>This article is about the PATCH HTTP verb and how it should be used. That being said, things have changed and it’s fine to use it differently.</description><link>https://williamdurand.fr/2014/02/14/please-do-not-patch-like-an-idiot/</link><dc:creator>schmidt2</dc:creator><dc:date>2020-02-05T09:13:22+01:00</dc:date><dc:subject>PATCH complexity design REST HTTP API outdated simplicity </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This article is about the PATCH HTTP verb and how it should be used. That being said, things have changed and it’s fine to use it differently.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PATCH"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/design"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/REST"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/HTTP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/API"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/outdated"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/simplicity"/></rdf:Bag></taxo:topics></item><item rdf:about="https://people.eecs.berkeley.edu/~jordan/courses.html"><title>Courses By Michael Jordan</title><description>Courses into CS and Stats</description><link>https://people.eecs.berkeley.edu/~jordan/courses.html</link><dc:creator>kirk86</dc:creator><dc:date>2020-01-28T15:40:17+01:00</dc:date><dc:subject>complexity notes website stats probability course lecture computation </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Courses into CS and Stats&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/probability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computation"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.tandfonline.com/doi/abs/10.1080/07294360.2019.1677569?journalCode=cher20"><title>Being more human: rooting learning analytics through resistance and reconnection with the values of higher education</title><description>Parkes, Benkwitz, Bardy, Myler, &amp; Peters, 2020</description><link>https://www.tandfonline.com/doi/abs/10.1080/07294360.2019.1677569?journalCode=cher20</link><dc:creator>ereidt</dc:creator><dc:date>2020-01-12T12:08:00+01:00</dc:date><dc:subject>complexity paper ethics becoming dialogue learninganalytics highered humanism retention studentsaspartners </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Parkes, Benkwitz, Bardy, Myler, &amp;amp; Peters, 2020&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ethics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/becoming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dialogue"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learninganalytics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/highered"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/humanism"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/retention"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/studentsaspartners"/></rdf:Bag></taxo:topics></item><item rdf:about="https://lucatrevisan.github.io/"><title>Luca Trevisan Lecture Notes on Theoretical CS and ML</title><description>Luca Trevisan Lecture Notes on Theoretical CS, ML and Optim</description><link>https://lucatrevisan.github.io/</link><dc:creator>kirk86</dc:creator><dc:date>2019-11-14T20:16:45+01:00</dc:date><dc:subject>complexity notes website optimization stats probability course lecture computation theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Luca Trevisan Lecture Notes on Theoretical CS, ML and Optim&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stats"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/probability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://lucatrevisan.wordpress.com/lecture-notes/"><title>Lecture Notes | in theory</title><description>This page provides quick links to lecture notes that I have written for various classes: CS254: A graduate class on computational complexity (Stanford) [Spring 2010 Class Home Page] [Notes for Lectures 1-8] CS278: A graduate class on computational complexity (Berkeley) [Spring 2001 Class Home Page] [Fall 2002 Class Home Page] [2001 Lecture Notes in book…</description><link>https://lucatrevisan.wordpress.com/lecture-notes/</link><dc:creator>kirk86</dc:creator><dc:date>2019-11-09T20:39:24+01:00</dc:date><dc:subject>complexity notes website optimization course lecture computation theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This page provides quick links to lecture notes that I have written for various classes: CS254: A graduate class on computational complexity (Stanford) [Spring 2010 Class Home Page] [Notes for Lectures 1-8] CS278: A graduate class on computational complexity (Berkeley) [Spring 2001 Class Home Page] [Fall 2002 Class Home Page] [2001 Lecture Notes in book…&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/notes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-055j-the-art-of-approximation-in-science-and-engineering-spring-2008/readings/"><title>The Art of Approximation in Science and Engineering | MIT OpenCourseWare</title><description>The Art of Approximation in Science and Engineering | MIT OpenCourseWare</description><link>https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-055j-the-art-of-approximation-in-science-and-engineering-spring-2008/readings/</link><dc:creator>kirk86</dc:creator><dc:date>2019-10-31T13:33:34+01:00</dc:date><dc:subject>approximate complexity website book </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The Art of Approximation in Science and Engineering | MIT OpenCourseWare&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/approximate"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/></rdf:Bag></taxo:topics></item><item rdf:about="https://courses.cs.washington.edu/courses/cse599s/19wi/"><title>CSE 599s Communication Complexity</title><description>Communication Complexity</description><link>https://courses.cs.washington.edu/courses/cse599s/19wi/</link><dc:creator>kirk86</dc:creator><dc:date>2019-07-22T18:24:22+02:00</dc:date><dc:subject>complexity website course information </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Communication Complexity&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/website"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/></rdf:Bag></taxo:topics></item><item rdf:about="http://math.bu.edu/people/mkon/talkdag2.pdf"><title>talkdag2.wxp</title><description></description><link>http://math.bu.edu/people/mkon/talkdag2.pdf</link><dc:creator>kirk86</dc:creator><dc:date>2019-06-13T16:01:21+02:00</dc:date><dc:subject>complexity machine-learning foundations theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-06-13T16:01:21+02:00&#034; href=&#034;http://math.bu.edu/people/mkon/talkdag2.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://math.bu.edu/people/mkon/talkdag2.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine-learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/foundations"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://math.bu.edu/people/mkon/FOCM05Talkn2.pdf"><title>FOCM05TALKn2.wxp</title><description></description><link>http://math.bu.edu/people/mkon/FOCM05Talkn2.pdf</link><dc:creator>kirk86</dc:creator><dc:date>2019-06-13T15:57:22+02:00</dc:date><dc:subject>complexity mathematics svms theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-06-13T15:57:22+02:00&#034; href=&#034;http://math.bu.edu/people/mkon/FOCM05Talkn2.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://math.bu.edu/people/mkon/FOCM05Talkn2.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/svms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item></rdf:RDF>