AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:23
Program 
Deadlines 
Inquiries: meet@ams.org
1995 Fall Southern Sectional Meeting
Greensboro, NC, November 1718, 1995
Meeting #906
Associate secretaries:
Robert J Daverman, AMS
daverman@math.utk.edu
Special Session on Complexity Theory

Friday November 17, 1995, 8:00 a.m.10:50 a.m.
Special Session on Complexity Theory, I
Triad Ballroom West, Greensboro Hilton Hotel
Organizers:
Jie Wang, University of North Carolina, Greensboro

8:00 a.m.
The complexity of matrix rank and feasible systems of linear equations.
Eric W. Allender*, Rutgers University, Piscataway
Robert Beals, Institute for Advanced Study
Mitsunori Ogihara, University of Rochester
(9066826)

8:30 a.m.
Comparing complexity classes.
Ronald V. Book*, University of California, Santa Barbara
(9066828)

9:00 a.m.
The resolution of a Hartmanis conjecture: $P$sparse hard sets.
JinYi Cai*, State University of New York, Buffalo
D. Sivakumar, State University of New York, Buffalo
(9066829)

9:30 a.m.
The bounded query complexity of $NP$approximation problems.
Richard Chang*, University of Maryland, Baltimore County
(9066830)

10:00 a.m.
Inverting Onto functions.
Stephen A. Fenner*, University of Southern Maine
Lance J. Fortnow, University of Chicago
Ashish Naik, University of Chicago
John Rogers, University of Chicago
(9066831)

10:30 a.m.
Sharply bounded alternation within $P$.
Stephen A. Bloch, Adelphi University
Jonathan F. Buss, University of Waterloo
Judy Goldsmith*, University of Kentucky
(9066832)

Friday November 17, 1995, 2:15 p.m.6:05 p.m.
Special Session on Complexity Theory, II
Blue Ridge, Greensboro Hilton Hotel
Organizers:
Jie Wang, University of North Carolina, Greensboro

2:15 p.m.
Tree canonization and transitive closure.
Kousha Etessami, University of Massachusetts, Amherst
Neil Immerman*, University of Massachusetts, Amherst
(9066837)

2:45 p.m.
The study on the computation theory over ordered rings and fields.
Li Xiang*, Guizhou University, People's Republic of China
Li Guangyuan, Guizhou University, People's Republic of China
Song Ronggong, Guizhou University, People's Republic of China
(9066839)

3:15 p.m.
Resource bounded measure, then and now.
Luc Longpre*, University of Texas, El Paso
(9066840)

3:45 p.m.
Observations on measure and lowness for $\Delta_2^P$.
Jack H. Lutz*, Iowa State University
(9066825)

4:15 p.m.
Independence properties of algorithmically random sequences.
Steven M. Kautz*, RandolphMacon Woman's College
(9066838)

4:45 p.m.
The $PL$ hierarchy collapses.
Mitsunori Ogihara*, University of Rochester
(9066841)

5:15 p.m.
Applications of errorcorrecting codes in complexity theory.
Kenneth W. Regan*, State University of New York, Buffalo
(9066842)

5:45 p.m.
Nonimmunity of $NEXP$complete sets.
Nicholas Tran*, University of Pennsylvania
(9066845)

Saturday November 18, 1995, 2:15 p.m.5:35 p.m.
Special Session on Complexity Theory, III
Blue Ridge, Greensboro Hilton Hotel
Organizers:
Jie Wang, University of North Carolina, Greensboro

2:15 p.m.
Lower bounds for circuits with mod gates and one exact threshold gate.
Frederic Green*, Clark University
(9066833)

2:45 p.m.
Linearly restrictable sets and applications in complexity theory.
Sanjay Gupta*, Virginia Polytechnic Institute and State University
(9066834)

3:15 p.m.
On averagecase computational complexity.
Osamu Watanabe*, Tokyo Institute of Technology, Japan
(9066844)

3:45 p.m.
Average time complexity classes.
Alan L. Selman*, State University of New York, Buffalo
Jinyi Cai, State University of New York, Buffalo
(9066843)

4:15 p.m.
Averagecase hierarchies.
Jay Belanger*, Northeast Missouri State University and University of North Carolina, Greensboro
(9066827)

4:45 p.m.
Semifeasible computation.
Lane A. Hemaspaandra*, University of Rochester
(9066835)

5:15 p.m.
Finding large cliques in very large graphs.
Steven Homer*, Boston University
Marcus Peinado, Boston University
(9066836)
Inquiries: meet@ams.org