Pages that link to "Item:Q4907578"

The following pages link to Strong Direct Product Theorems for Quantum Communication and Query Complexity (Q4907578):

Displaying 11 items.

• A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
• A strong direct product theorem for quantum query complexity (Q354645) (← links)
• Improved direct product theorems for randomized query complexity (Q693002) (← links)
• Approximation of \(\operatorname{sgn} (x)\) on two symmetric intervals by rational functions with fixed poles (Q902187) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• Simulation theorems via pseudo-random properties (Q2281252) (← links)
• New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
• The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
• (Q5158501) (← links)
• (Q5875509) (← links)
• (Q5875514) (← links)