On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates.

Saved in:
Bibliographic Details
Title: On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates.
Authors: Sergeev, Igor' S.1 (AUTHOR) isserg@gmail.com
Source: Discrete Mathematics & Applications. Aug2019, Vol. 29 Issue 4, p241-254. 14p.
Database: Mathematics Source
Full text is not displayed to guests.
Be the first to leave a comment!
You must be logged in first