
Search the dblp DataBase
Shih Ping Tung:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Shih Ping Tung
Algorithms for Sentences over Integral Domains. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1990, v:47, n:2, pp:189197 [Journal]
 Shih Ping Tung
Skolem functions of arithmetical sentences. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2003, v:185, n:1, pp:5665 [Journal]
 Shih Ping Tung
Polynomial Time Algorithms for Sentences over Number Fields [Citation Graph (0, 0)][DBLP] Inf. Comput., 1992, v:97, n:2, pp:262276 [Journal]
 Shih Ping Tung
The Bounds of Skolem Functions and Their Applications [Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:120, n:1, pp:149154 [Journal]
 Shih Ping Tung
Computational Complexity of Arithmetical Sentences [Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:120, n:2, pp:315325 [Journal]
 Shih Ping Tung
Sentences over Integral Domains and Their Computational Complexities. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1999, v:149, n:2, pp:99133 [Journal]
 Shih Ping Tung
Computational Complexities of Diophantine Equations with Parameters. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:3, pp:324336 [Journal]
 Shih Ping Tung
Approximate Solutions of Polynomial Equations. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2002, v:33, n:2, pp:239254 [Journal]
 Shih Ping Tung
Definability in Number Fields. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1987, v:52, n:1, pp:152155 [Journal]
 Shih Ping Tung
Decidable Fragments of Field Theories. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1990, v:55, n:3, pp:10071018 [Journal]
 Shih Ping Tung
Arithmetic Definability by Formulas with Two Quantifiers. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1992, v:57, n:1, pp:111 [Journal]
 Shih Ping Tung
Complexity of Sentences Over Number Rings. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:1, pp:126143 [Journal]
Search in 0.004secs, Finished in 0.004secs
