@Article{dihe:newdir,
  author = 	 {W. Diffie and E. Hellman},
  title = 	 {New directions in Cryptography},
  fjournal = 	 {IEEE Transactions on Information Theory},
  journal = 	 {IEEE Trans. Inf. Theory},
  year = 	 1976,
  volume =	 22,
  number =	 5,
  pages =	 {644--654}
}





@Misc{fre:cichon,
  author =	 {D. H. Fremlin},
  title =	 {Cichon's Diagram},
  howpublished = {presented at the
S{\'e}minaire Initiation {\`a} l'Analyse, G. Choquet, M. Rogalski, J.
Saint Raymond, at the Universit{\'e} Pierre et Marie Curie, Paris, 23e
ann{\'e}e.},
  year =	 {1983/194}
}




@Article{gouja:lagrmeth,
  author = 	 {I. P. Goulden and D. M. Jackson},
  title = 	 {The Enumeration of Directed
Closed {E}uler Trails and Directed {H}amiltonian Circuits by
{L}angrangian Methods},
  journal = 	 {European Journal of Combinatorics},
  year = 	 1981,
  volume =	 2,
  pages =	 {131--212}
}



@Book{hapa:graphenum,
  author =	 {F. Harary and E. M. Palmer},
  title = 	 {Graphical Enumeration},
  publisher = 	 {Academic Press},
  year = 	 1973
}




@InProceedings{imlelu:oneway,
  author = 	 {R. Impagliazzo and L. Levin and M. Luby},
  title = 	 {Pseudo-random Generation from One-Way Functions},
  booktitle =	 {Proc. 21st STOC},
  pages =	 {12--24},
  year =	 1989,
  address =	 {New York},
  publisher =	 {ACM}
}




@TechReport{komiyo:unipfunc,
  author = 	 {M. Kojima and S. Mizuno and A. Yoshise},
  title = 	 {A New Continuation Method
for Complementarity Problems With Uniform $p$-Functions},
  institution =  {Tokyo Inst. of Technology, Dept. of Information Sciences},
  year = 	 1987,
  number =	 {B-194},
  address =	 {Tokyo}
}




@TechReport{komiyo:lincomp,
  author = 	 {M. Kojima and S. Mizuno and A. Yoshise},
  title = 	 {A Polynomial-Time Algorithm For a Class of Linear
Complementarity Problems},
  institution =  {Tokyo Inst. of Technology, Dept. of Information Sciences},
  year = 	 1987,
  number =	 {B-193},
  address =	 {Tokyo}
}




@Article{liuchow:formalsum,
  author = 	 {C. J. Liu and Yutze Chow},
  title = 	 {On Operator and Formal Sum Methods for
Graph Enumeration Problems},
  journal = 	 {SIAM J. Algorith. and Discr. Meth.},
  fjournal = 	 {SIAM Journal of Algorithms and Discrete Methods},
  year = 	 1984,
  volume =	 5,
  pages =	 {384--438}
}




@Article{mami:matrixth,
  author = 	 {M. Marcus and H. Minc},
  title = 	 {A Survey of Matrix Theory and Matrix
Inequalities},
  journal = 	 {Complementary Series in Mathematics},
  year = 	 1964,
  volume =	 14,
  pages =	 {21--48}
}




@TechReport{miyoki:lincomp,
  author = 	 {S. Mizuno and A. Yoshise and T. Kikuchi},
  title = 	 {Practical Polynomial Time
Algorithms for Linear Complementarity Problems},
  institution =  {Tokyo Inst. of Technology, Dept. of Industrial Engineering
and Management},
  year = 	 1988,
  number =	 13,
  address =	 {Tokyo},
  month =	 {April}
}




@TechReport{moad:quadpro,
  author = 	 {R. D. Monteiro and I. Adler},
  title = 	 {Interior Path Following Primal-Dual
Algorithms, Part {II}: Quadratic Programming},
  institution =  {Dept. of Industrial Engineering and Operations Research},
  year = 	 1987,
  type =	 {Working Paper},
  month =	 {August}
}




@Book{ste:sint,
  author =	 {E. M. Stein},
  title = 	 {Singular Integrals and Differentiability Properties
of Functions},
  publisher = 	 {Princeton Univ. Press},
  year = 	 1970,
  address =	 {Princeton, NJ}
}





@PhdThesis{ye:intalg,
  author = 	 {Y. Ye},
  title = 	 {Interior Algorithms for Linear, Quadratic and Linearly
Constrained Convex Programming},
  school = 	 {Stanford Univ., Dept. of Engineering--Economic Systems},
  year = 	 1987,
  address =	 {Palo Alto, CA},
  month =	 {July}
}