| |
Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Miscellaneous (G.2.m)
|
|
 |
|
|
| |
|
|
| |
1-8 of 8
Reviews about "Miscellaneous (G.2.m)":
|
Date Reviewed |
| |
Descriptions of groups of prime-power order
Newman M., Nickel W., Niermeyer A. Journal of Symbolic Computation 25(5): 665-682, 1998. Type: Article
The algorithms studied in this paper provide a useful way to describe groups of prime-power order. The authors show that this approach often makes it possible to divide the study of such groups into three phases: a power-commutator pre...
|
Oct 1 1998 |
| |
On some decision problems for trace codings
Bruyère V., De Felice C., Guaiana G. Theoretical Computer Science 148(2): 227-260, 1995. Type: Article
One way to model concurrent processes is to use a letter to represent each action of a concurrent system. If two actions can occur concurrently, then their letters are independent. This approach reduces questions about concurrent proce...
|
Aug 1 1996 |
| |
Correctness of fixpoint transformations
Wei J. Theoretical Computer Science 129(1): 123-142, 1994. Type: Article
Fixpoint theory is noteworthy for being quite abstract, although it has several applications to computer science. Thus it allows theoreticians to work in abstract mathematics, with practical utility in the not-too-distant background. T...
|
Jul 1 1995 |
| |
Symbolic parametrization of curves
Sendra J., Winkler F. Journal of Symbolic Computation 12(6): 607-631, 1991. Type: Article
Symbolic algorithms for computing a rational parametrization of a plane algebraic curve are developed. Some familiarity with the study of algebraic geometry is necessary for full appreciation of the details of this paper. The paper is ...
|
Jul 1 1993 |
| |
Relating equivalence and reducibility to sparse sets
Allender E., Hemachandra L., Ogiwara M., Watanabe O. SIAM Journal on Computing 21(3): 521-539, 1992. Type: Article
Several classes of sets that are equivalent to sparse sets or can be reduced to sparse sets are identified and studied. Also, several fundamental questions about the relationships between equivalence to sparse sets and reducibility to...
|
Apr 1 1993 |
| |
Abstract and concrete categories
Adámek J., Herrlich H., Strecker G., Wiley-Interscience, New York, NY, 1990. Type: Book (9780471609223)
The authors of this remarkable book express the basic concepts and results of the theory of structures in the language of category theory. As the vague concept of a “structure” has a formalization in the concept of ...
|
Jul 1 1992 |
| |
The expected-outcome model of two-player games
Abramson B., Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991. Type: Book (9780273033349)
The marriage of games, as decision-making models, to computers, as decision-making machines, is natural. A key question faced by decision makers is how potential domain configurations can be quantified by a static evaluation function. ...
|
Sep 1 1991 |
| |
Introduction to finite fields and their applications
Lidl R., Niederreiter H. (ed), Cambridge University Press, New York, NY, 1986. Type: Book (9780521307062)
This is a textbook edition of the monograph Finite Fields [1]. The emphasis is on applications, and thus many of the more theoretical topics found in that earlier volume are not included here. The stated prerequisites include a ...
|
Jun 1 1987 |
| |
|
|
| |
|
|
