Ed. Board
sdmathM (FTP file sdmathLMS.zip)
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Automatic graphs and D0L-sequences of finite graphs
Intrinsic complexity of learning geometrical concepts from positive data
One-way permutations and self-witnessing languages
Complex-valued wavelet network
On the approximability of clique and related maximization problems
Papers to Appear
HA11093M (FTP file HA11093LMS.zip)
TOC