| 2008 |
|---|
| 13 | EE | Shih Ping Tung:
Computational complexity of sentences over fields.
Inf. Comput. 206(7): 791-805 (2008) |
| 2003 |
|---|
| 12 | EE | Shih Ping Tung:
Skolem functions of arithmetical sentences.
Inf. Comput. 185(1): 56-65 (2003) |
| 2002 |
|---|
| 11 | EE | Shih Ping Tung:
Approximate Solutions of Polynomial Equations.
J. Symb. Comput. 33(2): 239-254 (2002) |
| 1999 |
|---|
| 10 | | Shih Ping Tung:
Sentences over Integral Domains and Their Computational Complexities.
Inf. Comput. 149(2): 99-133 (1999) |
| 1995 |
|---|
| 9 | | Shih Ping Tung:
The Bounds of Skolem Functions and Their Applications
Inf. Comput. 120(1): 149-154 (1995) |
| 8 | | Shih Ping Tung:
Computational Complexity of Arithmetical Sentences
Inf. Comput. 120(2): 315-325 (1995) |
| 1992 |
|---|
| 7 | | Shih Ping Tung:
Polynomial Time Algorithms for Sentences over Number Fields
Inf. Comput. 97(2): 262-276 (1992) |
| 6 | | Shih Ping Tung:
Arithmetic Definability by Formulas with Two Quantifiers.
J. Symb. Log. 57(1): 1-11 (1992) |
| 1991 |
|---|
| 5 | | Shih Ping Tung:
Complexity of Sentences Over Number Rings.
SIAM J. Comput. 20(1): 126-143 (1991) |
| 1990 |
|---|
| 4 | | Shih Ping Tung:
Algorithms for Sentences over Integral Domains.
Ann. Pure Appl. Logic 47(2): 189-197 (1990) |
| 3 | | Shih Ping Tung:
Decidable Fragments of Field Theories.
J. Symb. Log. 55(3): 1007-1018 (1990) |
| 1987 |
|---|
| 2 | | Shih Ping Tung:
Computational Complexities of Diophantine Equations with Parameters.
J. Algorithms 8(3): 324-336 (1987) |
| 1 | | Shih Ping Tung:
Definability in Number Fields.
J. Symb. Log. 52(1): 152-155 (1987) |
