Shih Ping Tung - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2009

Algorithms for near solutions to polynomial equationsShih Ping Tung. JSC, 44(10):1410-1424, 2009. [doi]

2008

Computational complexity of sentences over fieldsShih Ping Tung. iandc, 206(7):791-805, 2008. [doi]

2003

Skolem functions of arithmetical sentencesShih Ping Tung. iandc, 185(1):56-65, 2003. [doi]

2002

Approximate Solutions of Polynomial EquationsShih Ping Tung. JSC, 33(2):239-254, 2002. [doi]

1999

Sentences over Integral Domains and Their Computational ComplexitiesShih Ping Tung. iandc, 149(2):99-133, 1999.

1995

The Bounds of Skolem Functions and Their ApplicationsShih Ping Tung. iandc, 120(1):149-154, July 1995.

Computational Complexity of Arithmetical SentencesShih Ping Tung. iandc, 120(2):315-325, August 1995.

1992

Arithmetic Definability by Formulas with Two QuantifiersShih Ping Tung. JSYML, 57(1):1-11, 1992.

Polynomial Time Algorithms for Sentences over Number FieldsShih Ping Tung. iandc, 97(2):262-276, April 1992.

1991

Complexity of Sentences Over Number RingsShih Ping Tung. SICOMP, 20(1):126-143, 1991.

1990

Decidable Fragments of Field TheoriesShih Ping Tung. JSYML, 55(3):1007-1018, 1990.

Algorithms for Sentences over Integral DomainsShih Ping Tung. APAL, 47(2):189-197, 1990.

1988

Definability on Formulas With Single QuantifierShih Ping Tung. mlq, 34(2):105-108, 1988. [doi]

1987

Definability in Number FieldsShih Ping Tung. JSYML, 52(1):152-155, 1987.

Computational Complexities of Diophantine Equations with ParametersShih Ping Tung. jal, 8(3):324-336, 1987.

Sign in or sign up to see more results.

runs on WebDSL