The following pages link to Irit Dinur (Q645128):
Displaying 50 items.
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- On the hardness of approximating minimum vertex cover (Q816330) (← links)
- Proof of an intersection theorem via graph homomorphisms (Q819191) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- (Q1764290) (redirect page) (← links)
- Graph products, Fourier analysis and spectral techniques (Q1764292) (← links)
- Approximating CVP to within almost-polynomial factors is NP-hard (Q1878613) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Near coverings and cosystolic expansion (Q2136118) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- The hardness of 3-uniform hypergraph coloring (Q2368586) (← links)
- Independent sets in graph powers are almost contained in juntas (Q2427036) (← links)
- On the Fourier tails of bounded functions over the discrete cube (Q2480580) (← links)
- PCP characterizations of NP (Q2819531) (← links)
- Conditional hardness for approximate coloring (Q2931398) (← links)
- On the fourier tails of bounded functions over the discrete cube (Q2931406) (← links)
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (Q2941514) (← links)
- (Q2955002) (← links)
- The Computational Benefit of Correlated Instances (Q2989033) (← links)
- Direct Sum Testing (Q2989047) (← links)
- Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121) (← links)
- (Q3096563) (← links)
- (Q3549711) (← links)
- Intersecting Families are Essentially Contained in Juntas (Q3557506) (← links)
- Conditional Hardness for Approximate Coloring (Q3575151) (← links)
- The importance of being biased (Q3579199) (← links)
- A new multilayered PCP and the hardness of hypergraph vertex cover (Q3581279) (← links)
- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (Q3588404) (← links)
- The Structure of Winning Strategies in Parallel Repetition Games (Q3588431) (← links)
- Robust Local Testability of Tensor Products of LDPC Codes (Q3595411) (← links)
- (Q4503941) (← links)
- (Q4638090) (← links)
- Cube vs. Cube Low Degree Test. (Q4638094) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- (Q5009534) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- (Q5093398) (← links)
- (Q5111160) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q5171197) (← links)
- Towards a proof of the 2-to-1 games conjecture? (Q5230304) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q5230352) (← links)
- Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract] (Q5236315) (← links)
- List Decoding with Double Samplers (Q5236316) (← links)
- Analytical approach to parallel repetition (Q5259598) (← links)
