Results 231 to 240 of about 311,159 (279)
Some of the next articles are maybe not open access.
Computer algebra symbolic and algebraic computation
ACM SIGSAM Bulletin, 1982Computer algebra is an alternative and complement to numerical mathematics. Its importance is steadily increasing. This volume is the first systematic and complete treatment of computer algebra. It presents the basic problems of computer algebra and the best algorithms now known for their solution with their mathematical foundations, and complete ...
B. Buchberger +3 more
openaire +1 more source
Fundamenta Informaticae, 2019
We investigate computability-theoretic properties of contact algebras. These structures were introduced by Dimov and Vakarelov in [Fundam. Inform. 74 (2006), 209–249] as an axiomatization for the region-based theory of space. We prove that the class of countable contact algebras is complete with respect to degree spectra of nontrivial structures ...
openaire +2 more sources
We investigate computability-theoretic properties of contact algebras. These structures were introduced by Dimov and Vakarelov in [Fundam. Inform. 74 (2006), 209–249] as an axiomatization for the region-based theory of space. We prove that the class of countable contact algebras is complete with respect to degree spectra of nontrivial structures ...
openaire +2 more sources
Computer Algebra and Bifurcations
Numerical Algorithms, 2003The authors investigate implicit linear and nonlinear differential equations using methods from computer algebra. They derive conditions under which these equations admit polynomial solutions. Moreover, the result is constructive, and the construction of the solution can be seen as quadratic Newton iteration. Finally, they apply their techniques to the
Achachi, Nisrine +1 more
openaire +1 more source
1993
Abstract Sorting Algorithms for a PRAM computer. We have already seen the Batcher sorting algorithm. It was one of the first parallel sorting algorithms developed. In 1978 Preparata published several SIMD-parallel algorithms for sorting n numbers in O(lgn) time - see [123].
openaire +1 more source
Abstract Sorting Algorithms for a PRAM computer. We have already seen the Batcher sorting algorithm. It was one of the first parallel sorting algorithms developed. In 1978 Preparata published several SIMD-parallel algorithms for sorting n numbers in O(lgn) time - see [123].
openaire +1 more source
Koszul Algebras and Computations
2017A Koszul algebra R is a \(\mathbb{N}\)-graded K-algebra whose residue field K has a linear free resolution as an R-module. Many papers and lectures have been given on this topic, so here we collect various properties and facts which are related to being a Koszul algebra, and illustrate their mutual implications or counter-examples.
BIGATTI, ANNA MARIA, DE NEGRI, EMANUELA
openaire +1 more source
ACM SIGSAM Bulletin, 2002
Mathematical software systems, such as Mathematica, Maple, Derive, and so on, are substantially based on enormous advances in the area of mathematics known as Computer Algebra or Symbolic Mathematics.
openaire +2 more sources
Mathematical software systems, such as Mathematica, Maple, Derive, and so on, are substantially based on enormous advances in the area of mathematics known as Computer Algebra or Symbolic Mathematics.
openaire +2 more sources
Algebraic computation in geometry
Mathematics and Computers in Simulation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Computer Algebra and Computing Special Functions
Programming and Computer Software, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Computer Algebra Systems and Symbolic Computations
Journal of Mathematical Sciences, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Variational algorithms for linear algebra
Science Bulletin, 2021Xiaosi Xu, Jinzhao Sun, Suguru Endo
exaly