Searching for authors named "Luca Trevisan" – sorted by Relevance.
-
Interactive and probabilistic proof-checking
- Interactive and Probabilistic Proof-Checking Luca Trevisan # January 18, 2000 Abstract
- Add To MetaCart
-
A Note on Deterministic Approximate Counting for k-DNF
- A Note on Deterministic Approximate Counting for k-DNF [Draft] Luca Trevisan # November 21, 2002
- Add To MetaCart
-
Constructions of Near-Optimal Extractors Using Pseudo-Random Generators
- Constructions of Near-Optimal Extractors Using Pseudo-Random Generators [Preliminary Version] Luca
- Cited by 20 (3 self) – Add To MetaCart
-
Approximating satisfiable satisfiability problems (Extended Abstract)
- Approximating Satisfiable Satisfiability Problems [Extended Abstract] Luca Trevisan ? Abstract
- Cited by 1 (1 self) – Add To MetaCart
-
On Local versus Global Satisfiability
- On Local versus Global Satisfiability [Preliminary Version] Luca Trevisan March 19, 1997
- Cited by 4 (0 self) – Add To MetaCart
-
A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees
- A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees Luca Trevisan Dipartimento
- Cited by 11 (0 self) – Add To MetaCart
-
Approximating Satisfiable Satisfiability Problems
- Approximating Satisfiable Satisfiability Problems Luca Trevisan y August 6, 1997 Abstract We
- Cited by 18 (3 self) – Add To MetaCart
-
Inapproximability of combinatorial optimization problems
- Inapproximability of Combinatorial Optimization Problems Contents Luca Trevisan ∗ July 27, 2004
- Cited by 14 (1 self) – Add To MetaCart
-
Positive Linear Programming, Parallel Approximation and PCP's
- Positive Linear Programming, Parallel Approximation and PCP's ? Luca Trevisan Universit`a di Roma
- Cited by 23 (10 self) – Add To MetaCart
-
Non-Approximability Results for Optimization Problems on Bounded Degree Instances
- Non-approximability results for optimization problems on bounded degree instances Luca Trevisan
- Cited by 43 (3 self) – Add To MetaCart

