Shih Ping Tung

发表

Computational complexity of sentences over fields

Shih Ping Tung, S. Tung, 2008, Inf. Comput..

Skolem functions of arithmetical sentences

Shih Ping Tung, 2003, Inf. Comput..

Algorithms for near solutions to polynomial equations

Shih Ping Tung, S. Tung, 2009, J. Symb. Comput..

The Bounds of Skolem Functions and Their Applications

Shih Ping Tung, 1995, Inf. Comput..

Computational Complexity of Arithmetical Sentences

Shih Ping Tung, S. Tung, 1995, Inf. Comput..

Definability in Number Fields

Shih Ping Tung, 1987, J. Symb. Log..

Algorithms for Sentences over Integral Domains

Shih Ping Tung, S. Tung, 1990, Ann. Pure Appl. Log..

Arithmetic Definability by Formulas with Two Quantifiers

Shih Ping Tung, 1992, J. Symb. Log..

Decidable fragments of field theories

Shih Ping Tung, S. Tung, 1990, Journal of Symbolic Logic.

Sentences over Integral Domains and Their Computational Complexities

Shih Ping Tung, S. Tung, 1999, Inf. Comput..

Approximate Solutions of Polynomial Equations

Shih Ping Tung, S. Tung, 2002, J. Symb. Comput..

Polynomial Time Algorithms for Sentences over Number Fields

Shih Ping Tung, S. Tung, 1992, Inf. Comput..

Complexity of Sentences Over Number Rings

Shih Ping Tung, 1991, SIAM J. Comput..

Computational Complexities of Diophantine Equations with Parameters

Shih Ping Tung, S. Tung, 1987, J. Algorithms.

Definability on Formulas With Single Quantifier

Shih Ping Tung, 1988, Math. Log. Q..