Pages that link to "Item:Q2458941"
From MaRDI portal
The following pages link to The quantum adversary method and classical formula size power bounds (Q2458941):
Displaying 16 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- New bounds on the half-duplex communication complexity (Q831813) (← links)
- On convex complexity measures (Q964405) (← links)
- Smallest formulas for the parity of \(2^k\) variables are essentially unique (Q974758) (← links)
- A trade-off between classical and quantum circuit size for an attack against CSIDH (Q2027261) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- (Q3002763) (← links)
- LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY (Q3015424) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique (Q3511317) (← links)
- Formula lower bounds via the quantum method (Q4978064) (← links)
- All Classical Adversary Methods Are Equivalent for Total Functions (Q5061885) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
- One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size (Q5386213) (← links)