
#1
Nov3012, 04:45 PM

P: 783

In the field of computer science, algorithms are often assigned a "complexity" class that is a measure of the time complexity of an algorithm. An algorithm with higher time complexity can take longer to compute than one with less time complexity.
I was wondering if circuits also have a "computational complexity". That is, does there exist a classification of circuit types by the speed with which they operate as a function of their input sizes? BiP 



#2
Nov3012, 05:26 PM

P: 3,844

Never heard of that.



Register to reply 
Related Discussions  
Complexity Big O, little o  Linear & Abstract Algebra  3  
Basic general ed classes before classes for 4 yr Bachelor's degree?  Academic Guidance  5  
Switching power circuits with small control circuits  Electrical Engineering  14  
Complexity Classes as Pure Sets  General Math  6  
Probabilistic complexity classes and acceptable sources of entropy  Set Theory, Logic, Probability, Statistics  0 