Can We Break Intractability Using Randomization or the Average Case Setting?
Joseph F. Traub · 1993
The following papers cover results of the researchers and make up the final report: (1) A Surprising and Important New Result, by J F Traub, Feb 25, 1994, (2) Recent Progress in Information-Based Complexity, by J F Traub and H wozinakowski, Invited Paper, Bulletin European Assoc for Theoretical Computer Science, Oct 1993, Number 51, pages 141-154 and (3) Breaking Intractability, by J F Traub and H Woziakowski, published as cover story of Scientific American, Jan 1994.