On Negations in Boolean Networks (Q3644711)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On Negations in Boolean Networks	scientific article

Statements

scholarly article

0 references

On Negations in Boolean Networks (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-03456-5_2

0 references

Lecture Notes in Computer Science

0 references

publication date

12 November 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Boolean function

0 references

monotone network

0 references

nonmonotone network

0 references

network complexity

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-03456-5_2

0 references

0 references

The monotone circuit complexity of Boolean functions

0 references

The Potential of the Approximation Method

0 references

A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates

0 references

0 references

On the Complexity of Negation-Limited Boolean Networks

0 references

Symmetric approximation arguments for monotone lower bounds without sunflowers

0 references

A Boolean function requiring 3n network size

0 references

An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution

0 references

On Graphs that do not Contain a Thomsen Graph

0 references

0 references

0 references

0 references

0 references

Higher lower bounds on monotone size

0 references

Combinatorics of monotone computations

0 references

The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging

0 references

On the Inversion Complexity of a System of Functions

0 references

Monotone switching circuits and Boolean matrix product

0 references

Some remarks on Boolean sums

0 references

Complexity of monotone networks for Boolean matrix product

0 references

A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions

0 references

On another Boolean matrix

0 references

Shifting Graphs and Their Applications

0 references

The Power of Negative Thinking in Multiplying Boolean Matrices

0 references

0 references

Lower bounds on monotone complexity of the logical permanent

0 references

0 references

0 references

Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen

0 references

On the bottleneck counting argument

0 references

On the combinational complexity of certain symmetric Boolean functions

0 references

The gap between monotone and non-monotone circuit complexity is exponential

0 references

A 4n-lower bound on the monotone network complexity of a one-output Boolean function

0 references

Graph-theoretic properties in computational complexity

0 references

Negation is Powerless for Boolean Slice Functions

0 references

Switching functions whose monotone complexity is nearly quadratic

0 references

A new lower bound on the monotone network complexity of Boolean sums

0 references

Boolean functions whose monotone complexity is of size \(n^ 2\) / log n

0 references

0 references

An n3/2 lower bound on the monotone network complexity of the Boolean convolution

0 references

A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3644711

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3644711&oldid=35137114"