Pages that link to "Item:Q1904663"

The following pages link to Top-down lower bounds for depth-three circuits (Q1904663):

Displaying 19 items.

• Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
• The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
• A degree version of the Hilton-Milner theorem (Q1689057) (← links)
• The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
• Coloring cross-intersecting families (Q1753012) (← links)
• Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← links)
• Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
• Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
• A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
• Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
• Extremal problems in hypergraph colourings (Q5112450) (← links)
• (Q5743451) (← links)
• String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
• A generalization of diversity for intersecting families (Q6612310) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
• Depth-3 circuits for inner product (Q6614883) (← links)
• CNF encodings of symmetric functions (Q6635697) (← links)
• The regular languages of first-order logic with one alternation (Q6649495) (← links)