The following pages link to Luca Trevisan (Q190553):
Displaying 50 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Compression of samplable sources (Q813316) (← links)
- Approximating satisfiable satisfiability problems (extended abstract) (Q826119) (← links)
- Lower bounds for linear locally decodable codes and private information retrieval (Q862344) (← links)
- A note on minimum-area upward drawing of complete and Fibonacci trees (Q970209) (← links)
- A case study of de-randomization methods for combinatorial approximation algorithms (Q1282206) (← links)
- (Q1575254) (redirect page) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- On approximation scheme preserving reducibility and its applications (Q1969434) (← links)
- Lower bounds for max-cut via semidefinite programming (Q2081648) (← links)
- Simple dynamics for plurality consensus (Q2401681) (← links)
- Pseudorandomness and average-case complexity via uniform reductions (Q2475578) (← links)
- The Approximability of Constraint Satisfaction Problems (Q2706139) (← links)
- Construction of extractors using pseudo-random generators (extended abstract) (Q2819542) (← links)
- Pseudorandom generators without the XOR Lemma (extended abstract) (Q2819586) (← links)
- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865) (← links)
- Gowers uniformity, influence of variables, and PCPs (Q2931365) (← links)
- Pseudorandom walks on regular digraphs and the RL vs. L problem (Q2931408) (← links)
- On the complexity of bisimilarity for value-passing processes (Q2956690) (← links)
- Dense Model Theorems and Their Applications (Q3000531) (← links)
- (Q3002794) (← links)
- (Q3059320) (← links)
- (Q3078217) (← links)
- From Logarithmic Advice to Single-Bit Advice (Q3088181) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012) (← links)
- Almost Optimal Local Graph Clustering Using Evolving Sets (Q3177772) (← links)
- On the efficiency of local decoding procedures for error-correcting codes (Q3191974) (← links)
- A PCP characterization of NP with optimal amortized query complexity (Q3191985) (← links)
- (Q3413362) (← links)
- Average-Case Complexity (Q3522267) (← links)
- (Q3549626) (← links)
- On uniform amplification of hardness in NP (Q3581414) (← links)
- Hierarchies for semantic classes (Q3581434) (← links)
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs (Q3582782) (← links)
- Improved Pseudorandom Generators for Depth 2 Circuits (Q3588430) (← links)
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment (Q3612554) (← links)
- Extractors Using Hardness Amplification (Q3638898) (← links)
- Pseudorandom Bit Generators That Fool Modular Sums (Q3638908) (← links)
- Structure in Approximation Classes (Q4268816) (← links)
- Weak Random Sources, Hitting Sets, and BPP Simulations (Q4268859) (← links)
- (Q4390865) (← links)
- (Q4395335) (← links)
- Three theorems regarding testing graph properties (Q4417002) (← links)
- (Q4437488) (← links)
