<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="http://www.bibsonomy.org/user/hubertusbecker/algorithms"><title>BibSonomy bookmarks for /user/hubertusbecker/algorithms</title><link>http://www.bibsonomy.org/rss/user/hubertusbecker/algorithms</link><description>BibSonomy RSS Feed for /user/hubertusbecker/algorithms</description><items><rdf:Seq><rdf:li rdf:resource="http://www.americanscientist.org/template/AssetDetail/assetid/14705?&amp;print=yes"/></rdf:Seq></items></channel><item rdf:about="http://www.americanscientist.org/template/AssetDetail/assetid/14705?&amp;print=yes"><title>American Scientist Online - The Easiest Hard Problem</title><description></description><link>http://www.americanscientist.org/template/AssetDetail/assetid/14705?&amp;amp;print=yes</link><dc:creator>hubertusbecker</dc:creator><dc:date>2008-01-11T15:42:24+01:00</dc:date><dc:subject>physics algorithms programming computing mathematics math science complexity </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/physics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complexity"/></rdf:Bag></taxo:topics></item></rdf:RDF>