{"id":97606,"date":"2019-11-29T13:26:25","date_gmt":"2019-11-29T12:26:25","guid":{"rendered":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/"},"modified":"2019-11-29T13:26:25","modified_gmt":"2019-11-29T12:26:25","slug":"diku-bits-solving-exponentially-hard-problems-in-linear-time","status":"publish","type":"event","link":"https:\/\/uniavisen.dk\/en\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/","title":{"rendered":"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)"},"content":{"rendered":"

\u200bSpeaker<\/h3>\n

Jakob Nordstr\u00f6m, associate professor in the Algorithms and Complexity section at DIKU.<\/p>\n

Abstract<\/h3>\n

In an age when computers are everywhere – even in our pockets – complexity theory is the science of what such devices can achieve. A rich mathematical theory developed since the 1970s indicates that many important problems cannot be solved by efficient automated computation. But in parallel, applied research on these problems has led to methods that often works amazingly well in practice.<\/p>\n

How is ths possible, and is there way to bridge the cap between the theory and practice of efficient computation?<\/p>\n

Zooming in on Jakob Nordstr\u00f6m<\/h3>\n

Which courses do you teach (BSc and MSc)?<\/strong>
\nI have just started, so we are still in the process of figuring this out. But I will teach “Discrete Mathematics and Formal Languages” this spring, and it is somewhat likely that sooner or later I will get involved in courses like “Logic in Computer Science” and\/or “Computability and Complexity”.<\/p>\n

Which technology\/research\/projects\/startup are you excited to see\u00a0the evolution of?<\/strong>
\nMy own research, of course – otherwise I would not be doing what I am doing \ud83d\ude09 But artificial intelligence is a very exciting field, and I believe there are very interesting (and important) challenges remaining in getting computations to be verifiably correct, and in extracting explanations for how the results were reached.<\/p>\n

What is your favorite sketch from the DIKUrevy?<\/strong>
\nThis is one of the many exciting aspects of DIKU I look forward to learning more about in the future!<\/p>\n","protected":false},"excerpt":{"rendered":"

\u200bSpeaker Jakob Nordstr\u00f6m, associate professor in the Algorithms and Complexity section at DIKU. Abstract In an age when computers are everywhere – even in our pockets – complexity theory is the science of what such devices can achieve. A rich mathematical theory developed since the 1970s indicates that many important problems cannot be solved by […]<\/p>\n","protected":false},"author":0,"featured_media":97607,"template":"","class_list":["post-97606","event","type-event","status-publish","has-post-thumbnail","hentry","event_category-foredrag"],"acf":[],"yoast_head":"\nDIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)\" \/>\n<meta property=\"og:description\" content=\"\u200bSpeaker Jakob Nordstr\u00f6m, associate professor in the Algorithms and Complexity section at DIKU. Abstract In an age when computers are everywhere – even in our pockets – complexity theory is the science of what such devices can achieve. A rich mathematical theory developed since the 1970s indicates that many important problems cannot be solved by […]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/\" \/>\n<meta property=\"og:site_name\" content=\"University Post\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/uniavis\" \/>\n<meta property=\"og:image\" content=\"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1600\" \/>\n\t<meta property=\"og:image:height\" content=\"900\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:site\" content=\"@Uniavisen\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/\",\"url\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/\",\"name\":\"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/uniavisen.dk\\\/wp-content\\\/uploads\\\/2019\\\/11\\\/slide_jakobnordstrom.jpg\",\"datePublished\":\"2019-11-29T12:26:25+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/#primaryimage\",\"url\":\"https:\\\/\\\/uniavisen.dk\\\/wp-content\\\/uploads\\\/2019\\\/11\\\/slide_jakobnordstrom.jpg\",\"contentUrl\":\"https:\\\/\\\/uniavisen.dk\\\/wp-content\\\/uploads\\\/2019\\\/11\\\/slide_jakobnordstrom.jpg\",\"width\":1600,\"height\":900},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/diku-bits-solving-exponentially-hard-problems-in-linear-time\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/uniavisen.dk\\\/en\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Events\",\"item\":\"https:\\\/\\\/uniavisen.dk\\\/event\\\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/uniavisen.dk\\\/#website\",\"url\":\"https:\\\/\\\/uniavisen.dk\\\/\",\"name\":\"University Post\",\"description\":\"Independent of management\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/uniavisen.dk\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/","og_locale":"en_US","og_type":"article","og_title":"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)","og_description":"\u200bSpeaker Jakob Nordstr\u00f6m, associate professor in the Algorithms and Complexity section at DIKU. Abstract In an age when computers are everywhere – even in our pockets – complexity theory is the science of what such devices can achieve. A rich mathematical theory developed since the 1970s indicates that many important problems cannot be solved by […]","og_url":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/","og_site_name":"University Post","article_publisher":"https:\/\/www.facebook.com\/uniavis","og_image":[{"width":1600,"height":900,"url":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_site":"@Uniavisen","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/","url":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/","name":"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)","isPartOf":{"@id":"https:\/\/uniavisen.dk\/#website"},"primaryImageOfPage":{"@id":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/#primaryimage"},"image":{"@id":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/#primaryimage"},"thumbnailUrl":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","datePublished":"2019-11-29T12:26:25+00:00","breadcrumb":{"@id":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/#primaryimage","url":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","contentUrl":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","width":1600,"height":900},{"@type":"BreadcrumbList","@id":"https:\/\/uniavisen.dk\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/uniavisen.dk\/en\/"},{"@type":"ListItem","position":2,"name":"Events","item":"https:\/\/uniavisen.dk\/event\/"},{"@type":"ListItem","position":3,"name":"DIKU Bits: Solving Exponentially Hard Problems in Linear Time(?)"}]},{"@type":"WebSite","@id":"https:\/\/uniavisen.dk\/#website","url":"https:\/\/uniavisen.dk\/","name":"University Post","description":"Independent of management","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/uniavisen.dk\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"advancedCustomFields":{"event_category":{"term_id":73,"name":"Foredrag","slug":"foredrag","term_group":0,"term_taxonomy_id":73,"taxonomy":"event_category","description":"","parent":0,"count":852,"filter":"raw"},"start":"2019-12-03 12:15:00","add_end_time":true,"end":"2019-12-03 13:00:00","location":"Small UP1, DIKU, Universitetsparken 1, University of Copenhagen","host_name":" Jon Sporring (VILF), Martin Lilholm (VILU), Datalogisk Fagr\u00e5d","ticket_link":"","event_is_free":true,"event_poster":{"ID":97607,"id":97607,"title":"slide_jakobnordstrom.jpg","filename":"slide_jakobnordstrom.jpg","filesize":117834,"url":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","link":"https:\/\/uniavisen.dk\/en\/event\/diku-bits-solving-exponentially-hard-problems-in-linear-time\/slide_jakobnordstrom-jpg\/","alt":"","author":"0","description":"","caption":"","name":"slide_jakobnordstrom-jpg","status":"inherit","uploaded_to":97606,"date":"2019-11-29 12:26:26","modified":"2019-11-29 12:26:34","menu_order":0,"mime_type":"image\/jpeg","type":"image","subtype":"jpeg","icon":"https:\/\/uniavisen.dk\/wp-includes\/images\/media\/default.png","width":1600,"height":900,"sizes":{"thumbnail":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-150x150.jpg","thumbnail-width":150,"thumbnail-height":150,"medium":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-480x270.jpg","medium-width":480,"medium-height":270,"medium_large":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-768x432.jpg","medium_large-width":768,"medium_large-height":432,"large":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-1280x720.jpg","large-width":1280,"large-height":720,"1536x1536":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","1536x1536-width":1536,"1536x1536-height":864,"2048x2048":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom.jpg","2048x2048-width":1600,"2048x2048-height":900,"featured-soft":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-290x163.jpg","featured-soft-width":290,"featured-soft-height":163,"featured-hard":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-290x180.jpg","featured-hard-width":290,"featured-hard-height":180,"narrow":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-700x394.jpg","narrow-width":700,"narrow-height":394,"extended":"https:\/\/uniavisen.dk\/wp-content\/uploads\/2019\/11\/slide_jakobnordstrom-990x557.jpg","extended-width":990,"extended-height":557}},"short_description":"On 3 December Jakob Nordstr\u00f6m will present his talk \"Solving Exponentially Hard Problems in Linear Time(?)\" as part of the DIKU Bits lecture series. Participation is free and everyone is welcome to join!","old_url":""},"_links":{"self":[{"href":"https:\/\/uniavisen.dk\/en\/wp-json\/wp\/v2\/events\/97606","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/uniavisen.dk\/en\/wp-json\/wp\/v2\/events"}],"about":[{"href":"https:\/\/uniavisen.dk\/en\/wp-json\/wp\/v2\/types\/event"}],"version-history":[{"count":0,"href":"https:\/\/uniavisen.dk\/en\/wp-json\/wp\/v2\/events\/97606\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/uniavisen.dk\/en\/wp-json\/wp\/v2\/media\/97607"}],"wp:attachment":[{"href":"https:\/\/uniavisen.dk\/en\/wp-json\/wp\/v2\/media?parent=97606"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}