Tuesday, January 19
Session 34
Diverse Topics II
9:00 AM-10:20 AM
Room: Mencken
Chair: Martin Strauss, AT&T Laboratories Research
- 9:00-9:17 The Phase Transition in Random Horn Satisfiability
and Its Algorithmic Implications
- Gabriel Istrate, University of Rochester
- 9:20-9:37 Designing Proxies for Stock Market Indices is
Computationally Hard
- Ming-Yang Kao, Yale University; and Stephen R.Tate, University of
North Texas
- 9:40-9:57 Computing the Maximum Degree of Minors in Matrix
Pencils via Combinatorial Relaxation
- Satoru Iwata, Osaka University, Japan
- 10:00-10:17 Folding and One Straight Cut Suffice
- Erik D. Demaine, Martin L. Demaine, and Anna Lubiw, University of
Waterloo, Canada
tjf, 9/12/98, MMD, 10/14/98