English  |  正體中文  |  简体中文  |  0  
???header.visitor??? :  52693937    ???header.onlineuser??? :  806
???header.sponsordeclaration???
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
???ui.leftmenu.abouttair???

???ui.leftmenu.bartitle???

???index.news???

???ui.leftmenu.copyrighttitle???

???ui.leftmenu.link???

"shih ping tung"???jsp.browse.items-by-author.description???

???jsp.browse.items-by-author.back???
???jsp.browse.items-by-author.order1??? ???jsp.browse.items-by-author.order2???

Showing items 1-15 of 15  (1 Page(s) Totally)
1 
View [10|25|50] records per page

Institution Date Title Author
中原大學 2010-04 Max–min of polynomials and exponential diophantine equations Shih Ping Tung
中原大學 2003-08 Skolem Functions of Arithmetical Sentences Shih-Ping Tung
中原大學 2003 On polynomials taking small values at integral arguments II Roberto Dvornicich;Shih Ping Tung;Umberto Zannier
中原大學 2002-02 Approximate Solutions of Polynomial Equations Shih-Ping Tung
中原大學 1999-03-15 Sentences over Integral Domains and Their Computational Complexities Shih-Ping Tung
中原大學 1998-02 Logical and computational problems of arithmetical Sentences Shih-Ping Tung
中原大學 1995-08 Computational Complexity of Arithmetical Sentences Shih-Ping Tung
中原大學 1995-07 The Bounds Of Skolem Functions And Their Applications Shih-Ping Tung
中原大學 1992-03 Arithmetic Definability by Formulas with Two Quantifiers Shih-Ping Tung
中原大學 1992 Polynomial time algorithms for sentences over number fields Shih-Ping Tung
中原大學 1991 Complexity of Sentences over Number Rings Shih-Ping Tung
中原大學 1990-09 Decidable Fragments of Field Theories Shih-Ping Tung
中原大學 1990-05 Algorithms for Sentences over Integral Domains Shih-Ping Tung
中原大學 1988 Definability on Formulas With Single Quantifier Shih-Ping Tung
中原大學 1985 On weak number theories Shih-Ping Tung

Showing items 1-15 of 15  (1 Page(s) Totally)
1 
View [10|25|50] records per page