#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1970

2002

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michael F. Singer, B. David Saunders, B. F. Caviness
- SYMSACC
- 1981

In this paper we give an extension of the Liouville theorem [RISC69, p. 169] and give a number of examples which show that integration with special functions involves some phenomena that do not occur in integration with the elementary functions alone.
Our main result generalizes Liouville's theorem by allowing, in addition to the elementary functions,… (More)

- B. F. Caviness
- J. ACM
- 1970

This paper deals wi th the simplification problem of symbolic mathemat ics . The notion of canonical form is defined and presented as a well-defined al ternat ive to the concept of simplified form. Following Richardson it is shown tha t canonical forms do not exist for sufficiently rich classes of mathemat ica l expressions. However, wi th the aid of a… (More)

- B. F. Caviness, George E. Collins
- SYMSACC
- 1976

In this paper new algorithms are given for Gaussian integer division and the calculation of the greatest common divisor of two Gaussian integers. Empirical tests show that the new gcd algorithm is up to 5.39 times as fast as a Euclidean algorithm using the new division algorithm.

- B. F. Caviness, H. I. Epstein
- Inf. Process. Lett.
- 1977

It is a well-known empirical result that differentiation, especially higher order differentiation, of simple expressions can lead to long and complex expressions. In this paper we give some theoretical results that help to explain this phenomenon. In particular we show that in certain representations there exist expressions whose representations require… (More)

- B. F. Caviness
- European Conference on Computer Algebra
- 1985

- Michael Rothstein, B. F. Caviness
- SIAM J. Comput.
- 1979

- B. F. Caviness, Richard J. Fateman
- SYMSACC
- 1976

In this paper we discuss the problem of simplifying unnested radical expressions. We describe an algorithm implemented in MACSYMA that simplifies radical expressions and then follow this description with a formal treatment of the problem. Theoretical computing times for some of the algorithms are briefly discussed as is related work of other authors.

- B. F. Caviness, Myra Jean Prelle
- ACM SIGSAM Bulletin
- 1978

This paper gives a corollary to Schanuel's conjecture that indicates when an exponential or logarithmic constant is transcendental over a given field of constants. The given field is presumed to have been built up by starting with the rationals Q with π adjoined and taking algebraic closure, adjoining values of the exponential function or of some fixed… (More)

We show that in the ring generated by the integers and the functions x, sinxn and sin(x · sinxn) (n = 1, 2, . . .) defined on R it is undecidable whether or not a function has a positive value or has a root. We also prove that the existential theory of the exponential field C is undecidable. 1. Let S denote the class of expressions generated by the rational… (More)

- B. F. Caviness, Michael Rothstein
- ACM Annual Conference
- 1975

In this paper the Brown-Collins modular greatest common divisor algorithm for polynomials in Z[x<subscrpt>1</subscrpt>,...,x<subscrpt>v</subscrpt>], where Z denotes the ring of rational integers, is generalized to apply to polynomials in G[x<subscrpt>1</subscrpt>,...,x<subscrpt>v</subscrpt>], where G denotes the ring of Gaussian integers, i.e., complex… (More)