{"484671":{"#nid":"484671","#data":{"type":"external_news","title":"Dick Lipton Analyzes a Major Breakthrough in Theoretical Computer Science","body":[{"value":"\u003Cp\u003EThe discovery of a new solution to graph isomorphism, a classic problem in theoretical computer science, has captured the imagination of researchers everywhere, including our own Dick Lipton.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":"","uid":"27466","created_gmt":"2016-01-11 18:02:00","changed_gmt":"2016-10-08 02:27:52","author":"Dani Denton","boilerplate_text":"","field_publication":"","publication":"DDR (Disarmament","field_article_url":"","publication_url":"http:\/\/www.technologyreview.com\/news\/543511\/claimed-breakthrough-slays-classic-computing-problem-encryption-could-be-next\/","dateline":{"date":"2015-11-16T00:00:00-05:00","iso_date":"2015-11-16T00:00:00-05:00","tz":"America\/New_York"},"extras":[],"hg_media":{"349491":{"id":"349491","type":"image","title":"Dick Lipton compressed","body":null,"created":"1449245696","gmt_created":"2015-12-04 16:14:56","changed":"1475895073","gmt_changed":"2016-10-08 02:51:13","alt":"Dick Lipton compressed","file":{"fid":"201030","name":"dick-lipton.jpg","image_path":"\/sites\/default\/files\/images\/dick-lipton_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/dick-lipton_0.jpg","mime":"image\/jpeg","size":15804,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/dick-lipton_0.jpg?itok=TEhKjKiV"}}},"media_ids":["349491"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"10477","name":"Dick Lipton"},{"id":"147901","name":"graph isomorphism"},{"id":"108371","name":"MIT Technology Review"},{"id":"166941","name":"School of Computer Science"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}},"484691":{"#nid":"484691","#data":{"type":"external_news","title":"Lance Fortnow Discusses Advances in Circuit Lower Bounds","body":[{"value":"\u003Cp class=\u0022p1\u0022\u003ELance Fortnow comments on a new\u0026nbsp;\u003Ca href=\u0022http:\/\/web.stanford.edu\/%7Errwill\/acc-lbs.pdf\u0022\u003Ebreakthrough proof\u003C\/a\u003E\u0026nbsp;for computer science circuit complexity by theorists at Stanford University \u2014 calling it \u201cthe best progress in circuit lower bounds in nearly a quarter century.\u201d\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":"","uid":"27466","created_gmt":"2016-01-11 18:17:51","changed_gmt":"2016-10-08 02:27:52","author":"Dani Denton","boilerplate_text":"","field_publication":"","publication":"Metz Mayor","field_article_url":"","publication_url":"https:\/\/www.quantamagazine.org\/20150929-edit-distance-computational-complexity\/","dateline":{"date":"2015-09-29T00:00:00-04:00","iso_date":"2015-09-29T00:00:00-04:00","tz":"America\/New_York"},"extras":[],"hg_media":{"356631":{"id":"356631","type":"image","title":"Lance Fortnow compressed","body":null,"created":"1449245762","gmt_created":"2015-12-04 16:16:02","changed":"1475895089","gmt_changed":"2016-10-08 02:51:29","alt":"Lance Fortnow compressed","file":{"fid":"201396","name":"lance-fortnow_0.jpg","image_path":"\/sites\/default\/files\/images\/lance-fortnow_0_0.jpg","image_full_path":"http:\/\/www.tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/lance-fortnow_0_0.jpg","mime":"image\/jpeg","size":13586,"path_740":"http:\/\/www.tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/lance-fortnow_0_0.jpg?itok=rZTWAP8q"}}},"media_ids":["356631"],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"143141","name":"Lance Fortnow; School of Computer Science; Quanta Magazine"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}