Volume 6, 1999
: Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs.
: On the Sample Complexity for Nonoverlapping Neural Networks.
: Some Recent Progress on the Complexity of Lattice Problems.
: Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard.
: Randomized Complexity of Linear Arrangements and Polyhedra.
: On the Uniformity of Distribution of a Certain Pseudo-Random Function.
: A Non-linear Time Lower Bound for Boolean Branching Programs.
: The Global Power of Additional Queries to p-random Oracles.
: Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs.
: The Approximability of Set Splitting Problems and Satisfiability Problems with no Mixed Clauses.