Results 221 to 230 of about 318,184 (274)
On Defining Expressions for Entropy and Cross-Entropy: The Entropic Transreals and Their Fracterm Calculus. [PDF]
Entropy (Basel)Bergstra JA, Tucker JV.
europepmc +1 more source
Evolutions of partner-ruled surfaces with simultaneous inextensibility conditions. [PDF]
PLoS OneEren K, Ersoy S, Khan MNI.
europepmc +1 more source
Factorization norms and an inverse theorem for MaxCut. [PDF]
Math AnnBalla I, Hambardzumyan L, Tomon I.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Structures in Computer Science, 2001
We introduce a framework that generalizes algebraic specifications by equipping algebras with descriptions of evaluation strategies. The resulting abstract mathematical description allows one to model the implementation of algebras on various platforms in a way that is independent of the function-oriented specifications.We study algebras with ...
Walicki, Michał +2 more
openaire +2 more sources
We introduce a framework that generalizes algebraic specifications by equipping algebras with descriptions of evaluation strategies. The resulting abstract mathematical description allows one to model the implementation of algebras on various platforms in a way that is independent of the function-oriented specifications.We study algebras with ...
Walicki, Michał +2 more
openaire +2 more sources
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