algorithm - What is a circuit? -
the book algorithms demonstrates fast fourier transform through "circuit", using "wires" carry data. circuit? concept made author of book better demonstrate algorithm or recognized computer science concept?
the answer question is, yes, "circuits" recognized concept in theoretical computer science, drawing on related concept electronics. boolean circuit sounds like: model computation on binary strings, consisting of boolean logic gates strung wires. can find formal definition here, @ wikipedia.
where come in handy is, you've seen, determining complexity of particular problem. fft example accessible, famous example cook's definition of np-completeness, turns on proof determining whether given boolean circuit satisfiable np-complete.
barrington , maciel have series of computation complexity lecture notes introduce circuits in first lecture , continue use concept throughout.
Comments
Post a Comment