<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Fri, 24 Apr 2026 22:13:37 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/communicationtheory/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Communication complexity on identity]]></title><description><![CDATA[Communication complexity assignment 2 The communication protocol can be formally defined as fA: (∏<i,X) -> {0,1}, i mod 2==0 fB: (∏<i,Y) -> {0,1}, i mod 2==1 where ∏<i is the history of]]></description><link>http://direct.ecency.com/science/@dkabii/6jqkkf-leadership-discussion</link><guid isPermaLink="true">http://direct.ecency.com/science/@dkabii/6jqkkf-leadership-discussion</guid><category><![CDATA[science]]></category><dc:creator><![CDATA[dkabii]]></dc:creator><pubDate>Tue, 28 Nov 2017 09:27:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/3jpR3paJ37V8t3d5gG8YxUrFtTrvhgCDjjN8jFs75PW7CUHpF28pFdcLfmnBTS3WuJThjPnNj3uts1Un51qcYYFx5aQYWKEga63zZWfa5t1R9ZVvJjbc5LWYGVgRLrbsv4Bpr?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>