Sergej A. Lozkin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
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