<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Simplifying boolean expressions (part 2)</title><link>http://blogs.msdn.com/b/cyrusn/archive/2005/01/24/359429.aspx</link><description>So where do go about simplifying a boolean expression? Well, we can go about it through a series of pretty simple steps. EE and CS curriculums cover these algorithms depth and i’m going to use a pretty basic one. First let’s start with what a boolean</description><dc:language>en-US</dc:language><generator>Telligent Evolution Platform Developer Build (Build: 5.6.50428.7875)</generator></channel></rss>