On the complexity of planar Boolean circuits (Q1842774): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Meanders and their applications in lower bounds arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the complexity of symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple cuts, input repetition, and VLSI complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tapes versus one for off-line Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Crossovers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar realization of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of multilective VLSI algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for synchronous circuits and planar circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01277954 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1707277566 / rank
 
Normal rank

Latest revision as of 08:30, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of planar Boolean circuits
scientific article

    Statements

    On the complexity of planar Boolean circuits (English)
    0 references
    0 references
    19 July 1995
    0 references
    planar graphs
    0 references
    planar circuits
    0 references
    circuit complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references