Search w/in this Title for Titles All Reviews
	Journal of Symbolic Computation Academic Press, Inc.         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-10 of 236 reviews Date Reviewed     Exact transversal hypergraphs and application to Boolean &mgr;-functions Eiter T. Journal of Symbolic Computation 17(3): 215-225, 1994.  Type: Article, Reviews: (2 of 2) A hypergraph is a generalized structure of a graph in which an edge, called a hyperedge, can have more than two vertices. A subset T is said to be a transversal of a given hypergraph if it intersects every (non-empty... Nov 26 2020   Estimating the number of tetrahedra determined by volume, circumradius and four face areas using Groebner basis Tsai Y. Journal of Symbolic Computation 77162-174, 2016.  Type: Article Given a tetrahedron, we can compute its volume, its circumradius (radius of the sphere going through the four vertices), and the surface areas of the four faces. Mazur [1] asked, effectively, if this is injective; that is, given these ... Feb 22 2017   A new faster algorithm for factoring skew polynomials over finite fields Caruso X., Le Borgne J. Journal of Symbolic Computation 79, Part 2, 411-443, 2017.  Type: Article Let k be a finite field of characteristic p and size pqr, and let σ be an automorphism of k of order r. The ring of skew... Jan 13 2017   Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) Eraşcu M., Hong H. Journal of Symbolic Computation 75(C): 110-126, 2016.  Type: Article If we know that lies in [L,U], can we produce a better bounding interval? The obvious answer is the Secant-Newton map, replacing [L Jul 25 2016   Synthesis of list algorithms by mechanical proving Drămnesc I., Jebelean T. Journal of Symbolic Computation 69(C): 61-92, 2015.  Type: Article Program synthesis via extraction of programs from constructive proofs is now very well established, with a large literature base. There are still quite a few hurdles to overcome, but the meta-theory has been in place for quite some tim... Jan 11 2016   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    Computing real roots of real polynomials Sagraloff M., Mehlhorn K. Journal of Symbolic Computation 73(C): 46-86, 2016.  Type: Article The computation of roots of a univariate polynomial is the most classical task in computational algebra. Since this problem arises in very many applications, plenty of techniques for its solution have been proposed. In this paper, Sagr... Dec 1 2015   Beyond polynomials and Peano arithmetic-automation of elementary and ordinal interpretations Zankl H., Winkler S., Middeldorp A. Journal of Symbolic Computation 69(C): 129-158, 2015.  Type: Article Goodstein sequences and theorems are very popular because of their unboundedness with respect to multiple recursive functions and derivational complexity.... Sep 1 2015   Symbolic and numerical analysis of plates in bending using MATLAB Roque C. Journal of Symbolic Computation 61-623-11, 2014.  Type: Article This paper basically does what the title says. It makes two distinct uses of MATLAB, one symbolic and one numeric, to solve, in a meshless manner, the plate-bending problem. The symbolic code writes 50 MATLAB functions, typically a few... Feb 9 2015    Automated simplification of large symbolic expressions Bailey D., Borwein J., Kaiser A. Journal of Symbolic Computation 60120-136, 2014.  Type: Article The simplification of algebraic expressions is one of the major uses of any computer algebra system, and yet there is a paucity of material on the fundamental algorithms that underlie simplification. Such papers that exist tend to be q... Nov 19 2014       Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy