Search the dblp DataBase

Publications of Author

1. Shouwen Tang, Bin Fu, Tian Liu
   Exponential Time and Subexponential Time Sets. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1991, pp:230-237 [Conf]
   
2. Tian Liu
   A Note on Closeness between NP-Hard Sets and C=P. [Citation Graph (0, 0)][DBLP]
   J. Comput. Sci. Technol., 2000, v:15, n:2, pp:194-195 [Journal]
   
3. Tian Liu
   Some Structural Properties of SAT. [Citation Graph (0, 0)][DBLP]
   J. Comput. Sci. Technol., 2000, v:15, n:5, pp:439-444 [Journal]
   
4. Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu
   Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model. [Citation Graph (0, 0)][DBLP]
   TAMC, 2007, pp:624-631 [Conf]
   
5. Xin Li, Tian Liu, Han Peng, Hongtao Sun, Jiaqi Zhu
   Improved Exponential Time Lower Bound of Knapsack Problem under BT model [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
6. 
   The Fooling Set Problem for Unary Regular Language Is in NP. [Citation Graph (, )][DBLP]
   
   
7. 
   An Energy and Distance Based Clustering Protocol for Wireless Sensor Networks. [Citation Graph (, )][DBLP]
   
   
8. 
   Measurements of Radiation-Induced Skin Changes in Breast-Cancer Radiation Therapy Using Ultrasonic Imaging. [Citation Graph (, )][DBLP]
   
   
9. 
   An Implementation of Post-Processing Software in Quantum Key Distribution. [Citation Graph (, )][DBLP]
   
   
10. 
    Efficiency of Winnow Protocol in Secret Key Reconciliation. [Citation Graph (, )][DBLP]
    
    
11. 
    Nonacoustic Sensor Speech Enhancement Based on Wavelet Packet Entropy. [Citation Graph (, )][DBLP]
    
    
12. 
    On Exponential Time Lower Bound of Knapsack under Backtracking [Citation Graph (, )][DBLP]
    
    
13. 
    From k-SAT to k-CSP: Two Generalized Algorithms [Citation Graph (, )][DBLP]
    
    
14. 
    Exact phase transition of backtrack-free search with implications on the power of greedy algorithms [Citation Graph (, )][DBLP]