The following pages link to Shmuel Safra (Q178481):
Displaying 50 items.
- Testing juntas (Q598252) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- (Q816329) (redirect page) (← links)
- On the hardness of approximating minimum vertex cover (Q816330) (← links)
- On the complexity of approximating TSP with neighborhoods and related problems (Q853644) (← links)
- The Erdős-Hajnal conjecture for bull-free graphs (Q958690) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- (Q1606965) (redirect page) (← links)
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967) (← links)
- Approximating CVP to within almost-polynomial factors is NP-hard (Q1878613) (← links)
- On the complexity of price equilibria (Q1886458) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- On the complexity of approximating \(k\)-set packing (Q2506163) (← links)
- Relating word and tree automata (Q2576943) (← links)
- PCP characterizations of NP (Q2819531) (← links)
- (Q2921659) (← links)
- Algorithmic construction of sets for <i>k</i> -restrictions (Q2944511) (← links)
- Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- (Q3002828) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- (Q3191598) (← links)
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition (Q3446820) (← links)
- On the complexity of equilibria (Q3579177) (← links)
- The importance of being biased (Q3579199) (← links)
- (Q3579426) (← links)
- (Q3597148) (← links)
- Probabilistic checking of proofs (Q3841041) (← links)
- (Q4230321) (← links)
- (Q4234056) (← links)
- (Q4318695) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- (Q4527015) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)
- A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem (Q4943860) (← links)
- On independent sets, 2-to-2 games, and Grassmann graphs (Q4978004) (← links)
- Superspreaders and high variance infectious diseases (Q4992327) (← links)
- Towards a proof of the 2-to-1 games conjecture? (Q5230304) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q5230352) (← links)
- A Two Prover One Round Game with Strong Soundness (Q5494992) (← links)
- Heterogeneity and superspreading effect on herd immunity (Q5857568) (← links)
- Pandemic spread in communities via random graphs (Q5860335) (← links)
- Algorithms - ESA 2003 (Q5897267) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900924) (← links)
- On the hardness of approximating the chromatic number (Q5932643) (← links)
- Multivariate generating functions for information spread on multi-type random graphs (Q6058906) (← links)
