Pages that link to "Item:Q5422496"

The following pages link to Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs (Q5422496):

Displaying 14 items.

• A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
• A discrepancy lower bound for information complexity (Q343867) (← links)
• A strong direct product theorem for quantum query complexity (Q354645) (← links)
• Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
• How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
• Improved direct product theorems for randomized query complexity (Q693002) (← links)
• A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
• Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
• The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
• The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
• (Q5092454) (← links)
• (Q5140844) (← links)
• (Q5875509) (← links)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)