Vollmer, H. (2009). The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Theory of computing systems, 44(1), 82-90. https://doi.org/10.1007/s00224-007-9030-9
Citace podle Chicago (17th ed.)Vollmer, Heribert. "The Complexity of Deciding If a Boolean Function Can Be Computed by Circuits over a Restricted Basis." Theory of Computing Systems 44, no. 1 (2009): 82-90. https://doi.org/10.1007/s00224-007-9030-9.
Citace podle MLA (9th ed.)Vollmer, Heribert. "The Complexity of Deciding If a Boolean Function Can Be Computed by Circuits over a Restricted Basis." Theory of Computing Systems, vol. 44, no. 1, 2009, pp. 82-90, https://doi.org/10.1007/s00224-007-9030-9.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..