Pages that link to "Item:Q2638784"
From MaRDI portal
The following pages link to Applications of matrix methods to the theory of lower bounds in computational complexity (Q2638784):
Displaying 35 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- Subspace intersection graphs (Q712273) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- On convex complexity measures (Q964405) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- A combinatorial approach to complexity (Q1196691) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- Super-logarithmic depth lower bounds via the direct sum in communication complexity (Q1918946) (← links)
- Matrix rigidity (Q1970501) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Polystability in positive characteristic and degree lower bounds for invariant rings (Q2102173) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- The biclique covering number of grids (Q2335697) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions (Q3186844) (← links)
- Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes (Q4558295) (← links)
- The succinctness of the cover modality (Q4586149) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5009544) (← links)
- On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube (Q5090139) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Query Complexity of Sampling and Small Geometric Partitions (Q5364254) (← links)
- (Q5878634) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
