Pages that link to "Item:Q1071036"
From MaRDI portal
The following pages link to Decomposition of graphs and monotone formula size of homogeneous functions (Q1071036):
Displaying 11 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- Decompositions of graphs of functions and fast iterations of lookup tables (Q868394) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
- (Q3097200) (← links)
- (Q4385988) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- Improved boolean formulas for the Ramsey graphs (Q4845078) (← links)