"On the Complexity of Planar Boolean Circuits."

György Turán (1995)

Details and statistics

DOI: 10.1007/BF01277954

access: closed

type: Journal Article

metadata version: 2020-03-15

a service of  Schloss Dagstuhl - Leibniz Center for Informatics