研究與發表
研究計畫：
88學年度
語句邏輯完備性及複雜度下限(行政院國科會)
87學年度 網路複雜類的均勻性(行政院國科會)
逐例證明系統的複雜度(中正大學)
出版品及論文：
(一) 經審查論文(Refereed
Papers)
1.
Jui-Lin Lee, On uniform circuit complexity
of arithmetic functions, submitted to
Theoretical Computer
Science.
(二)會議論文(Conference
Papers)
1.
Jui-Lin Lee, Branching program, commutator,
and icosahedron, abstract submitted
and presented as a
contributed talk in Logic Colloquium
97, Leeds.
2.
Jui-Lin Lee, On uniform Frege proof
of pigeonhole principle, abstract submitted
and presented as a
contributed talk in Logic Colloquium
98, Prague.
3.
Jui-Lin Lee, Case proofs, presented
as a contributed talk in the 7th Asian
Logic Conference at Hsi-Tou,
Taiwan, 1999.
(三)技術報告及其他
1.
Jui-Lin Lee, Count and tree in uniform
, Ph.D. Thesis, University of Illinois
at Urbana-
Champaign, January 1997.
2.
Jui-Lin Lee, Counting in uniform  ,
TR97-034, Electronic Colloquium on Computational
Complexity, 1997
|
