Searching for authors named "Ryan Williams" – sorted by Relevance.
25 documents found, showing 1 through 10.
Next 10 →
-
Abstract Complexity in Type Theory
- … Abstract Complexity in Type Theory Ryan Williams \Lambda 1 Introduction We develop…
- Add To MetaCart
-
ABSTRACT Parallelizing Time With Polynomial Circuits
- …, USA. Copyright 2005 ACM 1-58113-986-1/05/0007 ...$5.00. Ryan Williams ∗ Computer Science Department…
- Add To MetaCart
-
Counting Exactly and Efficiently on Small Problems
- …Counting exactly and eciently on small problems Ryan Williams Abstract A greedy procedure…
- Add To MetaCart
-
Inductive Time-Space Lower Bounds for SAT and Related Problems
- …INDUCTIVE TIME-SPACE LOWER BOUNDS FOR SAT AND RELATED PROBLEMS Ryan Williams Abstract. We improve…
- Cited by 6 (3 self) – Add To MetaCart
-
On Computing k-CNF Formula Properties
- …On Computing k-CNF Formula Properties Ryan Williams ⋆ Computer Science Department Carnegie Mellon…
- Cited by 3 (0 self) – Add To MetaCart
-
Algorithms for Quantified Boolean Formulas
- … Fellowship. Ryan Williams ∗ 1 quantified Boolean formulas (QBF). QBF is a generalization…
- Cited by 1 (1 self) – Add To MetaCart
-
Space-Efficient Reversible Simulations
- …Space-Efficient Reversible Simulations Ryan Williams September 22, 2000 Abstract We study…
- Cited by 2 (0 self) – Add To MetaCart
-
Matrix-vector multiplication in sub-quadratic time (some preprocessing required
- …Matrix-Vector Multiplication in Sub-Quadratic Time (Some Preprocessing Required) Ryan Williams…
- Cited by 3 (1 self) – Add To MetaCart
-
A new algorithm for optimal 2-constraint satisfaction and its implications
- …A new algorithm for optimal 2-constraint satisfaction and its implications Ryan Williams…
- Cited by 9 (1 self) – Add To MetaCart
-
Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas
- …Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas R. Ryan Williams ⋆ Carnegie…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
