The following pages link to Umesh V. Vazirani (Q593776):
Displaying 50 items.
- A natural encoding scheme proved probabilistic polynomial complete (Q593778) (← links)
- Parallel searching of multidimensional cubes (Q685702) (← links)
- (Q705721) (redirect page) (← links)
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem (Q705722) (← links)
- Generating quasi-random sequences from semi-random sources (Q1088641) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253) (← links)
- (Q1892871) (redirect page) (← links)
- A Markovian extension of Valiant's learning model (Q1892872) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- Rigorous RG algorithms and area laws for low energy eigenstates in 1D (Q2412377) (← links)
- The duality gap for two-team zero-sum games (Q2416652) (← links)
- Simple and efficient leader election in the full information model (Q2817614) (← links)
- Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) (Q2817637) (← links)
- Molecular scale heat engines and scalable quantum computation (Q2819561) (← links)
- Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570) (← links)
- Approximation Algorithms for Union and Intersection Covering Problems (Q2911607) (← links)
- Certifiable quantum dice (Q2941597) (← links)
- Algorithms, games, and evolution (Q2962243) (← links)
- (Q3024780) (← links)
- The Two-Processor Scheduling Problem is in Random NC (Q3034827) (← links)
- (Q3044310) (← links)
- Computing with highly mixed states (extended abstract) (Q3192044) (← links)
- Quantum bit escrow (Q3192045) (← links)
- On two geometric problems related to the travelling salesman problem (Q3343801) (← links)
- Dense quantum coding and quantum finite automata (Q3455539) (← links)
- Computing with highly mixed states (Q3546320) (← links)
- AdWords and generalized online matching (Q3546342) (← links)
- (Q3549733) (← links)
- (Q3702366) (← links)
- (Q3732972) (← links)
- (Q3976407) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- (Q4230355) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- Quantum Complexity Theory (Q4376183) (← links)
- Strengths and Weaknesses of Quantum Computing (Q4376184) (← links)
- Introduction to Special Section on Quantum Computation (Q4376187) (← links)
- The Quantum Communication Complexity of Sampling (Q4441894) (← links)
- Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. (Q4638101) (← links)
- (Q4638111) (← links)
- (Q4736886) (← links)
- (Q4782696) (← links)
- (Q5002773) (← links)
- Reducibility Among Protocols (Q5019325) (← links)
- RSA bits are .732 + ε secure (Q5019343) (← links)
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device (Q5056420) (← links)
- Quantum Supremacy and the Complexity of Random Circuit Sampling (Q5090387) (← links)
- The detectability lemma and quantum gap amplification (Q5172736) (← links)
