The following pages link to Oded Regev (Q375694):
Displaying 50 items.
- (Q236646) (redirect page) (← links)
- A counterexample to monotonicity of relative mass in random walks (Q287781) (← links)
- Entropy-based bounds on dimension reduction in \(L^1\) (Q375695) (← links)
- Locally decodable codes and the failure of cotype for projective tensor products (Q691556) (← links)
- The complexity of the covering radius problem (Q814418) (← links)
- A note on the distribution of the distance from a lattice (Q1006407) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- Temporary tasks assignment resolved (Q1400898) (← links)
- Long monotone paths in line arrangements (Q1762943) (← links)
- Priority algorithms for makespan minimization in the subset model. (Q1853127) (← links)
- On-line restricted assignment of temporary tasks with unknown durations. (Q1853182) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- Concentration of Markov chains with bounded moments (Q2227486) (← links)
- The hardness of 3-uniform hypergraph coloring (Q2368586) (← links)
- Counterexamples to a conjecture of Woods (Q2411583) (← links)
- Independent sets in graph powers are almost contained in juntas (Q2427036) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Combinatorial algorithms for the unsplittable flow problem (Q2492628) (← links)
- (Q2753725) (← links)
- On the Space Complexity of Linear Programming with Preprocessing (Q2800577) (← links)
- Minimizing the flow time without migration (Q2819546) (← links)
- Quantum XOR Games (Q2828211) (← links)
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (Q2913824) (← links)
- Krivine schemes are optimal (Q2930639) (← links)
- Conditional hardness for approximate coloring (Q2931398) (← links)
- Lattice problems and norm embeddings (Q2931407) (← links)
- Bounded-error quantum state identification and exponential separations in communication complexity (Q2931421) (← links)
- Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568) (← links)
- On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy (Q3002779) (← links)
- An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching (Q3053154) (← links)
- Minimizing the Flow Time Without Migration (Q3149872) (← links)
- (Q3166191) (← links)
- (Q3171599) (← links)
- A Note on Discrete Gaussian Combinations of Lattice Vectors (Q3187176) (← links)
- Near-Optimal and Explicit Bell Inequality Violations (Q3191566) (← links)
- Efficient Rounding for the Noncommutative Grothendieck Inequality (Q3191601) (← links)
- Impossibility of a Quantum Speed-Up with a Faulty Oracle (Q3521965) (← links)
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (Q3521970) (← links)
- Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete (Q3521973) (← links)
- (Q3522439) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- Improved Inapproximability of Lattice and Coding Problems With Preprocessing (Q3547549) (← links)
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation (Q3548553) (← links)
- (Q3549646) (← links)
- On Ideal Lattices and Learning with Errors over Rings (Q3563827) (← links)
- Lattice Enumeration Using Extreme Pruning (Q3563839) (← links)
- Conditional Hardness for Approximate Coloring (Q3575151) (← links)
- A new multilayered PCP and the hardness of hypergraph vertex cover (Q3581279) (← links)
