Pages that link to "Item:Q4706225"
From MaRDI portal
The following pages link to Nondeterministic Quantum Query and Communication Complexities (Q4706225):
Displaying 17 items.
- Common information and unique disjointness (Q343843) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Quantum zero-error algorithms cannot be composed (Q1014398) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
- Quantum certificate complexity (Q2475404) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- The border support rank of two-by-two matrix multiplication is seven (Q4615808) (← links)
- (Q4638074) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Quantum attribute-based encryption: a comprehensive study (Q6050246) (← links)
