Skip navigation
  • Browse
  • Items
    • Issue Date
    • Author
    • Title
    • Subject
  • Researchers
  • English
  • 繁體
  • 简体
  1. You are Here:National Chiao Tung University Institutional Repository
  2. Publications
  3. Research Plans

標題: 解隨機化之研究(I)
Derandomization via Complexity Theory (I)
作者: 蔡錫鈞
TSAI SHI-CHUN
國立交通大學資訊工程學系
公開日期: 2003
官方說明文件#: NSC92-2213-E009-097
URI: http://hdl.handle.net/11536/92072
https://www.grb.gov.tw/search/planDetail?id=843488&docId=159790
Appears in Collections:Research Plans


Related Contents
  • IR@NYCU
  • CrossRef
  • 解隨機化之研究(II) / 蔡錫鈞;TSAI SHI-CHUN
  • 解隨機化之研究(III) / 蔡錫鈞;TSAI SHI-CHUN
  • 隨機計算與量子計算之研究(II) / 蔡錫鈞;TSAI SHI-CHUN
  • 理論密碼學與應用---子計畫II:擬亂數產生器與編碼及其密碼之應用(I) / 陳榮傑;CHEN RONG-JAYE
  • On the complexity of hardness amplification / Lu, Chi-Jen;Tsai, Shi-Chun;Wu, Hsin-Lung
  • Complexity of Hard-Core Set Proofs / Lu, Chi-Jen;Tsai, Shi-Chun;Wu, Hsin-Lung
  • Improved hardness amplification in NP / Lu, Chi-Jen;Tsai, Shi-Chun;Wu, Hsin-Lung
  • Inapproximability Results for the Weight Problems of Subgroup Permutation Codes / Shieh, Min-Zheng;Tsai, Shi-Chun
  • 適用於時變正交分頻多工系統之干擾消除技術 / 蔡宗翰;Tsung-Han Tsai;李大嵩;Ta-Sung Lee
Loading...

Items with full text/Total items : / (0%)
Visitors : 0      Online Users : 1

Copyright  ©  2002-2026   - Feedback - 
Powered by DSpace - Sitemap -  GitHub -  Sign on to:

Top