| 臺大學術典藏 |
2020-06-16T06:39:54Z |
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs.
|
Rosier, Louis E.;Yen, Hsu-Chun; Rosier, Louis E.; Yen, Hsu-Chun; HSU-CHUN YEN |
| 國立臺灣大學 |
1996 |
On the Complexity of Distributed Query Optimization
|
Wang, Chihping; Chen, Ming-Syan |
| 臺大學術典藏 |
1992 |
On the complexity of generating synchronizable test sequences
|
Liu, Lung-Tien; Chen, Gen-Huey; Lu, Ching-Sung; Liu, Lung-Tien; Chen, Gen-Huey; Lu, Ching-Sung |
| 國立臺灣大學 |
1992 |
On the complexity of generating synchronizable test sequences
|
Liu, Lung-Tien; Chen, Gen-Huey; Lu, Ching-Sung |
| 臺大學術典藏 |
2020-05-04T07:54:24Z |
On the complexity of generating synchronizable test sequences.
|
Liu, Lung-Tien; Chen, Gen-Huey; Lu, Ching-Sung; GEN-HUEY CHEN |
| 臺大學術典藏 |
1990 |
On the Complexity of Generating the Test Sequence Without Synchronization Problem
|
Lu, C. S.; Liu, L. T.; Chen, Gen-Huey; Liu, L. T.; 陳健輝; Lu, C. S.; Liu, L. T.; Chen, Gen-Huey; Lu, C. S. |
| 國立臺灣大學 |
1990 |
On the Complexity of Generating the Test Sequence Without Synchronization Problem
|
Liu, L. T.; 陳健輝; Lu, C. S.; Liu, L. T.; Chen, Gen-Huey; Lu, C. S. |
| 國立交通大學 |
2014-12-08T15:42:24Z |
On the complexity of hardness amplification
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:02:02Z |
On the complexity of point-in-polygon algorithms
|
Huang, CW; Shih, TY |
| 國立交通大學 |
2019-04-02T06:00:24Z |
On the complexity of point-in-polygon algorithms
|
Huang, CW; Shih, TY |
| 臺大學術典藏 |
2020-05-04T08:07:23Z |
On the complexity of query answering over incomplete XML documents.
|
Gheerbrant, Am?lie; Libkin, Leonid; Tan, Tony; TONY TAN |
| 國立臺灣科技大學 |
1992-09 |
On the complexity of search algorithms
|
Kuo-Liang Chung;鍾國亮;Wen-Chin Chen;Ferng-Ching Lin |
| 臺大學術典藏 |
1992 |
On the complexity of search algorithms
|
Chung, Kuo-Liang; Chen, Wen-Chin; Lin, Ferng-Ching; Chung, Kuo-Liang; Chen, Wen-Chin; Lin, Ferng-Ching |
| 國立臺灣大學 |
1992 |
On the complexity of search algorithms
|
Chung, Kuo-Liang; Chen, Wen-Chin; Lin, Ferng-Ching |
| 臺大學術典藏 |
2020-05-04T08:08:56Z |
On the Complexity of Search Algorithms.
|
Chung, Kuo-Liang; Chen, Wen-Chin; Lin, Ferng-Ching; WEN-CHIN CHEN |
| 臺大學術典藏 |
2020-06-11T06:47:40Z |
On the Complexity of Self-assembly Tasks
|
Chen, H.-L.; Chen, H.-L.; CHEN HO-LIN |
| 國立臺灣科技大學 |
2014 |
On the complexity of SINR outage constrained max-min-fairness multicell coordinated beamforming problem
|
Li W.-C., Chang T.-H., Chi C.-Y. |
| 國立臺灣科技大學 |
2013 |
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
|
Kloks, T.;Poon, S.-H.;Tsai, F.-R.;Wang, Y.-L. |
| 國立政治大學 |
2016-04 |
On the complexity of the El Farol Bar Game: A sensitivity analysis
|
陳樹衡; Chen, Shu-Heng; Gostoli, Umberto |
| 國立政治大學 |
2016-12 |
On the complexity of the El Farol Bar game: a sensitivity analysis
|
陳樹衡; Chen, Shu-Heng; Gostoli, Umberto |
| 臺大學術典藏 |
1998 |
On the complexity of the k-chain subgraph cover problem
|
Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng; Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng |
| 國立臺灣大學 |
1998 |
On the complexity of the k-chain subgraph cover problem
|
Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng |
| 臺大學術典藏 |
2020-05-04T07:54:17Z |
On the Complexity of the k-Chain Subgraph Cover Problem.
|
Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng; GEN-HUEY CHEN |
| 中華大學 |
2007 |
On the Complexity of the Max-Edge-Coloring Problem with Its Variants
|
俞征武; Yu, Chang Wu |
| 國立交通大學 |
2014-12-08T15:27:22Z |
On the complexity of the minimum and maximum global snapshot problems
|
Chen, LB; Wu, IC |
