On the complexity of planar Boolean circuits
Work
Year: 1995
Type: article
Source: Computational Complexity
Author György Turán
Institution Hungarian Academy of Sciences
Cites: 29
Cited by: 8
Related to: 10
FWCI: 0.481
Citation percentile (by year/subfield): 61.83
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed