Pages that link to "Item:Q794625"
From MaRDI portal
The following pages link to A Boolean function requiring 3n network size (Q794625):
Displaying 46 items.
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Almost-natural proofs (Q716305) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
- Complex Boolean networks obtained by diagonalization (Q1060185) (← links)
- Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
- Relativized circuit complexity (Q1069299) (← links)
- The complexity of central slice functions (Q1084375) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (Q1095871) (← links)
- Models of lower-bounds proofs (Q1107322) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- On monotone simulations on nonmonotone networks (Q1121853) (← links)
- Lower bounds for depth-restricted branching programs (Q1173954) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- The multiplicative complexity of quadratic boolean forms (Q1199694) (← links)
- Characterizing linear size circuits in terms of privacy (Q1305927) (← links)
- On the complexity of encoding in analog circuits (Q1350006) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- Local reduction (Q1641001) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Feebly secure cryptographic primitives (Q1946841) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008) (← links)
- The complexity of contract negotiation (Q2457671) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Circuit Lower Bounds for Average-Case MA (Q3194723) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Lower Bounds for the Size of Nondeterministic Circuits (Q3196391) (← links)
- A Feebly Secure Trapdoor Function (Q3392948) (← links)
- Local Reductions (Q3448833) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- RelativizedNC (Q3763591) (← links)
- Construction of Very Hard Functions for Multiparty Communication Complexity (Q4494482) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q5096789) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Hay from the haystack: explicit examples of exponential quantum circuit complexity (Q6109366) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
