1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Delay complexity of Boolean functions

  1. May 11, 2015 #1
    1. The problem statement, all variables and given/known data
    I don't really understand how/why every Boolean function of n variables may be implemented with a delay complexity of O(n).
    Could someone please try and explain?
    2. Relevant equations


    3. The attempt at a solution
    I was trying to show it using minterms (SOP). There is a maximum of 2^n minterms but how do I derive the delay? There is also a maximum of n-1 OR gates between these minterms.
     
  2. jcsd
  3. May 16, 2015 #2
    Thanks for the post! This is an automated courtesy bump. Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Delay complexity of Boolean functions
Loading...