Shih Ping Tung

15 papers Journal 15

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Algorithms for near solutions to polynomial equations. J. Symb. Comput. Shih Ping Tung
2008	J	`jnl`	Computational complexity of sentences over fields. Inf. Comput. Shih Ping Tung
2003	J	`jnl`	Skolem functions of arithmetical sentences. Inf. Comput. Shih Ping Tung
2002	J	`jnl`	Approximate Solutions of Polynomial Equations. J. Symb. Comput. Shih Ping Tung
1999	J	`jnl`	Sentences over Integral Domains and Their Computational Complexities. Inf. Comput. Shih Ping Tung
1995	J	`jnl`	Computational Complexity of Arithmetical Sentences Inf. Comput. Shih Ping Tung
1995	J	`jnl`	The Bounds of Skolem Functions and Their Applications Inf. Comput. Shih Ping Tung
1992	J	`jnl`	Arithmetic Definability by Formulas with Two Quantifiers. J. Symb. Log. Shih Ping Tung
1992	J	`jnl`	Polynomial Time Algorithms for Sentences over Number Fields Inf. Comput. Shih Ping Tung
1991	J	`jnl`	Complexity of Sentences Over Number Rings. SIAM J. Comput. Shih Ping Tung
1990	J	`jnl`	Algorithms for Sentences over Integral Domains. Ann. Pure Appl. Log. Shih Ping Tung
1990	J	`jnl`	Decidable Fragments of Field Theories. J. Symb. Log. Shih Ping Tung
1988	J	`jnl`	Definability on Formulas With Single Quantifier. Math. Log. Q. Shih Ping Tung
1987	J	`jnl`	Computational Complexities of Diophantine Equations with Parameters. J. Algorithms Shih Ping Tung
1987	J	`jnl`	Definability in Number Fields. J. Symb. Log. Shih Ping Tung