On the complexity of planar Boolean circuits

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1995 English Publisher:Springer Science and Business Media LLCJournal:Computational Complexity, volume 5, pages 24-42 (issn: 1016-3328, eissn: 1420-8954,

Copyright policy )

Authors: György Turán;

doi: 10.1007/bf01277954

On the complexity of planar Boolean circuits

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Hungarian Academy of Sciences
Hungary

Keywords

Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Applications of graph theory to circuits and networks, Models of computation (Turing machines, etc.), planar graphs, planar circuits, circuit complexity

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average