| |
Browse All Reviews > Computing Methodologies (I) > Symbolic and Algebraic Manipulation (I.1) > General (I.1.0)
|
|
 |
|
|
| |
|
|
| |
1-10 of 23
Reviews about "General (I.1.0)":
|
Date Reviewed |
| |
Advanced Boolean techniques: selected papers from the 13th International Workshop on Boolean Problems
Drechsler R., Soeken M., Springer International Publishing, New York, NY, 2019. 265 pp. Type: Book (978-3-030203-22-1)
Boolean functions--functions on the domain of the logical values “true” and “false”--represent a fundamental concept of computer science with applications in many areas, includi...
|
Apr 27 2020 |
| |
Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
Aguirre L., Martí-Oliet N., Palomino M., Pita I. Journal of Automated Reasoning 60(4): 421-463, 2018. Type: Article
Rewriting logic can naturally express both concurrent computation and logical deduction and is thus applied in system specification and verification. Here, a core question is whether, from an initial state, the execution of the system ...
|
Jan 3 2019 |
| |
Better answers to real questions
Košta M., Sturm T., Dolzmann A. Journal of Symbolic Computation 74(C): 255-275, 2016. Type: Article
Many scientific problems can be phrased as existential formulas over the real numbers. For example: For a fixed parameter a, are there x≥y such that x
|
Dec 18 2015 |
| |
Abstract algebra (Graduate Texts in Mathematics)
Grillet P., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 676 pp. Type: Book (9780387715674)
“Perhaps no single book can ... give a faithful picture ... [of] such a diverse and expanding field” as today’s algebra, states Grillet in the preface. This clear and exhaustive treatment of a subject, who...
|
Jul 15 2008 |
| |
Dense resultant of composed polynomials mixed-mixed case
Minimair M. Journal of Symbolic Computation 36(6): 825-834, 2003. Type: Article
This paper is devoted to solving the following problem: how to represent the multivariate dense (Macaulay) resultant of a composed polynomial family in terms of the resultants of the two families involved in the composition....
|
Apr 1 2004 |
| |
Lattice functions and equations
Rudeanu S., Springer-Verlag New York, Inc., New York, NY, 2001. 436 pp. Type: Book (9781852332662)
Boolean algebras and equations have been the subject of considerable theoretical and application-oriented investigation. One of the seminal works in this field, including Boolean functions and equations, has been Boolean functions a...
|
Oct 13 2003 |
| |
Computer algebra and symbolic computation: elementary algorithms
Cohen J., A. K. Peters, Ltd., Natick, MA, 2002. 300 pp. Type: Book (9781568811581)
The author defines the focus of this book as follows: “the formulation of algorithms that solve symbolic mathematical problems...the implementation of these algorithms in terms of the operations and control structures availa...
|
Mar 13 2003 |
| |
An algorithm of Katz and its application to the inverse Galois problem
Dettweiler M., Reiter S. Journal of Symbolic Computation 30(6): 761-798, 2000. Type: Article
The authors discuss a new approach for proving a basic result found previously by Katz [1]. That result was an algorithm to test whether there exists a linearly rigid tupple in GLn(C) whose elements genera...
|
Apr 16 2002 |
| |
Complexity of computing the local dimension of a semialgebraic set
Vorobjov N. Journal of Symbolic Computation 27(6): 565-579, 1999. Type: Article
A semialgebraic set V ⊆ Rn over a real closed field R is the set of points x = (x1 ,..., xn) satisfying a system of polynomial inequali...
|
Dec 1 1999 |
| |
Computing Sylow subgroups in permutation groups
Cannon J. (ed), Cox B., Holt D. Journal of Symbolic Computation 24(3-4): 303-316, 1997. Type: Article
The authors have used a wide variety of examples to demonstrate the effectiveness of new algorithms for the computation of Sylow subgroups. The effectiveness of these algorithms makes it possible to compute Sylow functions for consider...
|
Nov 1 1998 |
| |
|
|
| |
|
|
