Pages that link to "Item:Q1220384"

The following pages link to Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen (Q1220384):

Displaying 30 items.

• Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements (Q255774) (← links)
• Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
• A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
• A Boolean function requiring 3n network size (Q794625) (← links)
• Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables (Q895458) (← links)
• Reductions for monotone Boolean circuits (Q959813) (← links)
• Nearly optimal hierarchies for network and formula size (Q1061717) (← links)
• An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
• Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
• A 3n-lower bound on the network complexity of Boolean functions (Q1142030) (← links)
• Size bounds for superconcentrators (Q1170885) (← links)
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
• A class of Boolean functions with linear combinational complexity (Q1223937) (← links)
• The combinational complexity of equivalence (Q1228356) (← links)
• On the limits of gate elimination (Q1635510) (← links)
• On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
• Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
• Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth (Q1989349) (← links)
• On the power of nondeterministic circuits and co-nondeterministic circuits (Q2232269) (← links)
• New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
• Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
• Lower Bounds for the Size of Nondeterministic Circuits (Q3196391) (← links)
• On Negations in Boolean Networks (Q3644711) (← links)
• On the combinational complexity of certain symmetric Boolean functions (Q4146674) (← links)
• A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
• (Q5121914) (← links)
• Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
• Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)