Sergej A. Lozkin

Learn More
Hromkovif, The layout area of Boolean circuits is considered as a complexity measure of Boolean functions. Introducing the communication complexity of Boolean circuits and proving that this communication complexity squared provides a lower bound on the area complexity, one obtains a powerful lower-bound technique for the area complexity of Boolean(More)
  • 1