Knowledge

Computer algebra

Source 📝

4424: 4436: 3828: 2814: 3838: 2826: 460: 3848: 4460: 4448: 36: 1498:, while it is not necessary with a normal form (see below). Secondly, it may be the case, like for expressions involving radicals, that a canonical form, if it exists, depends on some arbitrary choices and that these choices may be different for two expressions that have been computed independently. This may make impracticable the use of a canonical form. 537:
This process of delayed evaluation is fundamental in computer algebra. For example, the operator "=" of the equations is also, in most computer algebra systems, the name of the program of the equality test: normally, the evaluation of an equation results in an equation, but, when an equality test is
1142:
As there is no way to make a good general choice of applying or not such a rewriting rule, such rewriting is done only when explicitly invoked by the user. For the distributivity, the computer function that applies this rewriting rule is typically called "expand". The reverse rewriting rule, called
495:
Even programs may be considered and represented as expressions with operator "procedure" and, at least, two operands, the list of parameters and the body, which is itself an expression with "body" as an operator and a sequence of instructions as operands. Conversely, any mathematical expression may
491:
of operands. In computer algebra software, the expressions are usually represented in this way. This representation is very flexible, and many things that seem not to be mathematical expressions at first glance, may be represented and manipulated as such. For example, an equation is an expression
926:
is designed for generating collisions when like terms are entered, allowing them to be combined as soon as they are introduced. This allows subexpressions that appear several times in a computation to be immediately recognized and stored only once. This saves memory and speeds up computation by
81: 1457:
that there may not exist an algorithm that decides whether two expressions representing numbers are semantically equal if exponentials and logarithms are allowed in the expressions. Accordingly, (semantic) equality may be tested only on some classes of expressions such as the
1493:
Normal forms are usually preferred in computer algebra for several reasons. Firstly, canonical forms may be more costly to compute than normal forms. For example, to put a polynomial in canonical form, one has to expand every product through
711: 1572:. Though his series on "Recursive functions of symbolic expressions and their computation by machine" remained incomplete, McCarthy and his contributions to artificial intelligence programming and computer algebra via Lisp helped establish 380:
computation with exactly represented data. Such an exact representation implies that, even when the size of the output is small, the intermediate data generated during a computation may grow in an unpredictable way. This behavior is called
1523:
or programmers to reprogram it between calculations, manipulate its many physical modules (or panels), and feed its IBM card reader. Female mathematicians handled the majority of ENIAC programming human-guided computation:
538:
needed, either explicitly asked by the user through an "evaluation to a Boolean" command, or automatically started by the system in the case of a test inside a program, then the evaluation to a Boolean result is executed.
246:
Computer algebra is widely used to experiment in mathematics and to design the formulas that are used in numerical programs. It is also used for complete scientific computations, when purely numerical methods fail, as in
1587:
Early efforts at symbolic computation, in the 1960s and 1970s, faced challenges surrounding the inefficiency of long-known algorithms when ported to computer algebra systems. Predecessors to Project MAC, such as
279:
for the computer science aspect of the subject and "computer algebra" for the mathematical aspect. In some languages the name of the field is not a direct translation of its English name. Typically, it is called
1140: 1035: 2030: 1260: 1448: 1490:
is such that an expression in normal form is semantically zero only if it is syntactically zero. In other words, zero has a unique representation as an expression in normal form.
541:
As the size of the operands of an expression is unpredictable and may change during a working session, the sequence of the operands is usually represented as a sequence of either
745:
like addition and multiplication. The standard way to deal with associativity is to consider that addition and multiplication have an arbitrary number of operands, that is that
1988: 1346: 1573: 1301: 608: 903:. In other words, in the internal representation of the expressions, there is no subtraction nor division nor unary minus, outside the representation of the numbers. 600: 1592:, sought to overcome algorithmic limitations through advancements in hardware and interpreters, while later efforts turned towards software optimization. 2570: 408:
Therefore, the basic numbers used in computer algebra are the integers of the mathematicians, commonly represented by an unbounded signed sequence of
2245:. ACM monograph series. History of programming languages conference, Association for computing machinery. New York London Toronto: Academic press. 3884: 935: 723:. There are several classes of rewriting rules to be considered. The simplest are rules that always reduce the size of the expression, like 1616:, a task required to simplify fractions and an essential component of computer algebra. Classical algorithms for this computation, such as 930:
Some rewriting rules sometimes increase and sometimes decrease the size of the expressions to which they are applied. This is the case of
385:. To obviate this problem, various methods are used in the representation of the data, as well as in the algorithms that manipulate them. 215:
alluding to the complexity of the main applications that include, at least, a method to represent mathematical data in a computer, a user
2864: 1577: 1040: 444: 941: 52:
If the information is appropriate for the lead of the article, this information should also be included in the body of the article.
918:
sorts the operands of sums and products into an order that places like terms in consecutive places, allowing easy detection. In
3581: 3553: 2563: 45: 3606: 2531: 2500: 2442: 2364: 2250: 2096: 1898: 1677: 1569: 914:
in order to combine or cancel them. Testing every pair of terms is costly with very long sums and products. To address this,
492:
with "=" as an operator, a matrix may be represented as an expression with "matrix" as an operator and its rows as operands.
311:, but these terms, which also refer to non-computational manipulation, are no longer used in reference to computer algebra. 4247: 3457: 1856: 1486:
is such that two expressions in canonical form are semantically equal if and only if they are syntactically equal, while a
1469:
To test the equality of two expressions, instead of designing specific algorithms, it is usual to put expressions in some
3611: 2883: 2620: 716:
A simpler expression than this is generally desired, and simplification is needed when working with general expressions.
328: 4392: 3877: 3116: 1624:
faced similar struggles. Thus, researchers turned to discovering methods of reducing polynomials (such as those over a
1613: 1557: 1176: 17: 4464: 3763: 3591: 3121: 2818: 2556: 2461: 2121: 1821: 67: 3928: 3851: 2945: 2830: 2769: 2655: 2610: 1773: 1738: 4342: 3239: 2708: 2595: 2404: 1697: 1687: 1659: 347: 136: 1373: 4440: 3530: 3492: 3149: 2857: 542: 2000: 1584:, whose competition facilitated significant development in computer algebra throughout the late 20th century. 3870: 3672: 3649: 3379: 3369: 2625: 271:
using the latter name to refer to kinds of symbolic computation other than the computation with mathematical
228: 1170:
appearing in an expression are simplified, they are usually considered as new indeterminates. For example,
4452: 3753: 3341: 3249: 3154: 2930: 2915: 2396: 1926:"Lecture 12: Rational Functions and Conversions — Introduction to Symbolic Computation 1.7.6 documentation" 1763: 1561: 1143:"factor", requires a non-trivial algorithm, which is thus a key function in computer algebra systems (see 431:
Programming an efficient implementation of the arithmetic operations is a hard task. Therefore, most free
4367: 3923: 3841: 3576: 3074: 2748: 1629: 1565: 468: 342:(International Symposium on Symbolic and Algebraic Computation), which is regularly sponsored by SIGSAM. 224: 2032:
The Feasibility of Automatic Storage Reclamation with Concurrent Program Execution in a LISP Environment
1642: 3938: 3813: 3462: 2600: 2343:
Kaltofen, E. (1983), Buchberger, Bruno; Collins, George Edwin; Loos, Rüdiger; Albrecht, Rudolf (eds.),
1516: 405:
of a fixed bounded size. Neither of these is convenient for computer algebra, due to expression swell.
2266: 2049: 1950: 4486: 4352: 4324: 3961: 3831: 3758: 3733: 3596: 3244: 2850: 1816:. Transgressive Computing 2006: A conference in honor of Jean Della Dora, (TC 2006). pp. 43–49. 1650: 1925: 1700:(also known as Pollard's lambda algorithm ): an algorithm for solving the discrete logarithm problem 183:, they are generally considered as distinct fields because scientific computing is usually based on 4397: 3682: 3515: 3101: 2970: 2764: 2012: 1728: 1703: 1356: 1306: 1156: 1144: 484: 236: 172: 2073: 1890: 706:{\displaystyle x\cdot a^{x-1}\cdot 0+a^{x}\cdot \left(1\cdot \log a+x\cdot {\frac {0}{a}}\right).} 4282: 4272: 4242: 4176: 3911: 3743: 3677: 3568: 3384: 3044: 2579: 1743: 1733: 1454: 1160: 432: 248: 219:(usually different from the language used for the implementation), a dedicated memory manager, a 207: 1665: 4380: 4277: 4257: 4252: 4181: 3906: 3808: 3639: 3520: 3287: 3277: 3272: 1808: 1609: 1268: 480: 324: 240: 196: 4407: 4337: 4214: 4138: 4077: 4062: 4057: 4034: 3916: 3778: 3748: 3738: 3634: 3548: 3424: 3364: 3331: 3321: 3204: 3169: 3159: 3096: 2965: 2940: 2935: 2900: 1748: 1671: 1520: 742: 394: 373: 355:. There are also several other journals that regularly publish articles in computer algebra. 284:
in French, which means "formal computation". This name reflects the ties this field has with
188: 184: 1882: 4387: 4267: 4262: 4186: 4087: 3538: 3510: 3482: 3477: 3306: 3282: 3234: 3217: 3212: 3194: 3184: 3179: 3141: 3091: 3086: 3003: 2949: 2690: 2587: 2480: 2144: 578: 425: 216: 180: 84: 1706:: an algorithm for dividing a polynomial by another polynomial of the same or lower degree 1363:
is the equality of their representation in a computer. This is easy to test in a program.
8: 4402: 4312: 4234: 4133: 4067: 4024: 4014: 3994: 3803: 3728: 3644: 3629: 3394: 3174: 3131: 3126: 3023: 3013: 2985: 2723: 2665: 1883: 1768: 1617: 1605: 1581: 1167: 176: 2510:
Buchberger, Bruno; Collins, George Edwin; Loos, Rüdiger; Albrecht, Rudolf, eds. (1983).
2484: 1576:
at the Massachusetts Institute of Technology and the organization that later became the
4428: 4347: 4287: 4219: 4209: 4148: 4123: 3999: 3956: 3951: 3768: 3667: 3543: 3500: 3409: 3351: 3336: 3326: 3111: 2910: 2698: 2537: 2512: 2473: 2430: 2344: 2079:. In Buchberger, Bruno; Collins, George Edwin; Loos, Rüdiger; Albrecht, Rudolf (eds.). 1600:
A large part of the work of researchers in the field consisted of revisiting classical
1545: 369: 88: 2417: 2282: 2202:"Recursive functions of symbolic expressions and their computation by machine, Part I" 534:; if they are not given any values, the result of the evaluation is simply its input. 4423: 4143: 4128: 4072: 4019: 3788: 3718: 3697: 3659: 3467: 3434: 3414: 3106: 3018: 2892: 2640: 2527: 2496: 2457: 2438: 2360: 2325: 2286: 2246: 2223: 2182: 2127: 2117: 2092: 1970: 1894: 1827: 1817: 1463: 1163: 4332: 4204: 4052: 3989: 3621: 3505: 3472: 3267: 3189: 3078: 3064: 3059: 3008: 2995: 2920: 2873: 2713: 2541: 2519: 2488: 2413: 2392: 2352: 2317: 2278: 2213: 2174: 2084: 1962: 1625: 1612:
for use in computer algebra. An example of this type of work is the computation of
919: 554: 440: 352: 148: 2437:. Translated from the French by A. Davenport and J. H. Davenport. Academic Press. 1712:: an algorithm for the calculus operation of indefinite integration (i.e. finding 1654: 4297: 4224: 4153: 3946: 3692: 3586: 3558: 3452: 3404: 3389: 3374: 3229: 3224: 3164: 3054: 3028: 2980: 2925: 2743: 2703: 2305: 2038:(Master's thesis). Naval Postgraduate School, Monterey/CA. p. 15. ADA165184. 1713: 1709: 1537: 1533: 421: 409: 320: 2356: 2351:, Computing Supplementa, vol. 4, Vienna: Springer Vienna, pp. 95–113, 2088: 1860: 4375: 4302: 4009: 3798: 3702: 3601: 3447: 3419: 1621: 1541: 1529: 1495: 1471: 931: 398: 345:
There are several journals specializing in computer algebra, the top one being
285: 220: 2523: 1966: 1482:
In computer algebra, "canonical form" and "normal form" are not synonymous. A
4480: 4163: 4095: 4047: 3687: 2975: 2329: 2290: 2227: 2186: 2131: 1974: 1831: 1758: 1753: 923: 907: 2321: 1674:: find sums of hypergeometric terms that are themselves hypergeometric terms 338:
There are several annual conferences on computer algebra, the premier being
4105: 4100: 4004: 3783: 3442: 2738: 2548: 2178: 1155:
Some fundamental mathematical questions arise when one wants to manipulate
417: 3862: 2218: 2201: 323:
that is specific to computer algebra, but this function is assumed by the
4307: 3971: 3894: 3773: 3399: 3311: 1525: 436: 144: 27:
Scientific area at the interface between computer science and mathematics
910:
of addition and multiplication. The problem is to quickly recognize the
4292: 4171: 3966: 3793: 3723: 3316: 3049: 2905: 2789: 1913: 1691: 1459: 911: 566: 550: 252: 232: 1367:
is when two expressions represent the same mathematical object, as in
3298: 3259: 2635: 2162: 2016: 1681: 927:
avoiding repetition of the same operations on identical expressions.
720: 164: 2492: 4196: 4115: 4042: 3359: 2842: 2779: 2660: 2645: 1951:"Élie Cartan's geometrical vision or how to avoid expression swell" 488: 459: 402: 202: 168: 163:, is a scientific area that refers to the study and development of 80: 2435:
Computer Algebra: Systems and Algorithms for Algebraic Computation
2114:
Computer Algebra: Systems and Algorithms for Algebraic Computation
48:
contains information that is not included elsewhere in the article
3981: 2784: 2718: 2650: 2058: 2001:"The Mathematica Kernel: Issues in the Design and Implementation" 1991:, from "Peculiarities of programming in computer algebra systems" 1632:) to a variant efficiently computable via a Euclidean algorithm. 1601: 915: 546: 335:(Special Interest Group on Symbolic and Algebraic Manipulation). 272: 227:
to perform usual operations, like simplification of expressions,
223:
for the input/output of mathematical expressions, a large set of
1135:{\displaystyle (x-1)(x^{4}+x^{3}+x^{2}+x+1)\rightarrow x^{5}-1.} 291:
Symbolic computation has also been referred to, in the past, as
2799: 2794: 2774: 2732: 2615: 1885:
Computer Algebra and Symbolic Computation: Mathematical Methods
1589: 738:. They are systematically applied in computer algebra systems. 476: 332: 1793: 179:. Although computer algebra could be considered a subfield of 2728: 2680: 2670: 2630: 2605: 2509: 1512: 1030:{\displaystyle (x+1)^{4}\rightarrow x^{4}+4x^{3}+6x^{2}+4x+1} 413: 339: 2675: 1949:
Neut, Sylvain; Petitot, Michel; Dridi, Raouf (2009-03-01).
1620:, proved inefficient over infinite fields; algorithms from 205:
applications that perform symbolic calculations are called
1166:. This is not a real restriction, because, as soon as the 2151:. University of Pennsylvania. Retrieved December 3, 2023. 487:
may be viewed as the symbol of an operator followed by a
199:
that have no given value and are manipulated as symbols.
1844: 1668:: finds a Gröbner basis (also mentions the F5 algorithm) 1957:. Polynomial System Solving in honor of Daniel Lazard. 938:. For example, the distributivity law allows rewriting 2429: 2111: 2083:. Computing Supplementa. Vol. 4. pp. 11–43. 1635: 2451: 1551: 1376: 1309: 1271: 1179: 1043: 944: 611: 581: 2514:
Computer Algebra: Symbolic and Algebraic Computation
2081:
Computer Algebra: Symbolic and Algebraic Computation
1479:, and to test the syntactic equality of the result. 496:
be viewed as a program. For example, the expression
2511: 2472: 2470: 2112:Davenport, J. H.; Siret, Y.; Tournier, É. (1988). 1442: 1340: 1295: 1254: 1159:in a computer. We consider mainly the case of the 1134: 1029: 705: 594: 518:as parameters. Executing this program consists in 506:may be viewed as a program for the addition, with 376:, it is common, in computer algebra, to emphasize 2471:Geddes, K. O.; Czapor, S. R.; Labahn, G. (1992). 2452:von zur Gathen, Joachim; Gerhard, Jürgen (2003). 1255:{\displaystyle (\sin(x+y)^{2}+\log(z^{2}-5))^{3}} 4478: 2145:"ENIAC in Action: What it Was and How it Worked" 1948: 1506: 849:, the simplest way is to systematically rewrite 2051:Macsyma Mathematics and System Reference Manual 1810:Making Computer Algebra More Symbolic (Invited) 1564:for computing symbolic expressions through the 2071: 3878: 2882:Note: This template roughly follows the 2012 2858: 2564: 719:This simplification is normally done through 2578: 2456:(2nd ed.). Cambridge University Press. 1511:Early computer algebra systems, such as the 3892: 2387:For a detailed definition of the subject: 2149:ENIAC: Celebrating Penn Engineering History 358: 3885: 3871: 2865: 2851: 2825: 2571: 2557: 2391: 2013:"The GNU Multiple Precision (GMP) Library" 1443:{\displaystyle (x+y)^{2}=x^{2}+2xy+y^{2}.} 565:The raw application of the basic rules of 416:, usually the largest base allowed by the 2433:; Siret, Yvon; Tournier, Èvelyne (1988). 2240: 2217: 2072:Buchberger, Bruno; Loos, Rüdiger (1983). 68:Learn how and when to remove this message 2342: 2199: 458: 195:computation with expressions containing 191:, while symbolic computation emphasizes 79: 2303: 2028: 1662:: factor polynomials over finite fields 1150: 314: 14: 4479: 3582:Knowledge representation and reasoning 2518:. Computing Supplementa. Vol. 4. 2425:For textbooks devoted to the subject: 1355:There are two notions of equality for 363: 3866: 3607:Philosophy of artificial intelligence 2846: 2552: 2397:"Symbolic Computation (An Editorial)" 2267:"Symbolic Computation (An Editorial)" 2160: 2003:. October 2006. Retrieved 2023-11-29. 1880: 1794:"ACM Association in computer algebra" 1643:List of algorithms § Computer algebra 1570:Massachusetts Institute of Technology 835:. In the case of expressions such as 420:. These integers allow to define the 4447: 2926:Energy consumption (Green computing) 2872: 1806: 1595: 372:is highly efficient for approximate 29: 4459: 3612:Distributed artificial intelligence 2884:ACM Computing Classification System 1636:Algorithms used in computer algebra 1614:polynomial greatest common divisors 906:Another difficulty occurs with the 522:the expression for given values of 329:Association for Computing Machinery 24: 3117:Integrated development environment 2382: 1568:programming language while at the 1552:Foundations and early applications 393:The usual numbers systems used in 134:using the computer algebra system 25: 4498: 3592:Automated planning and scheduling 3122:Software configuration management 2304:Feldman, Stuart I. (1975-11-01). 1678:Knuth–Bendix completion algorithm 560: 471:tree, from a 1985 Master's Thesis 463:Representation of the expression 435:and some commercial ones such as 4458: 4446: 4435: 4434: 4422: 3846: 3836: 3827: 3826: 2824: 2813: 2812: 2243:History of programming languages 1774:Symbolic artificial intelligence 1739:Computational algebraic geometry 1641:This section is an excerpt from 1475:or to put their difference in a 34: 4343:Computational complexity theory 3837: 3240:Computational complexity theory 2475:Algorithms for Computer Algebra 2405:Journal of Symbolic Computation 2336: 2306:"A brief description of Altran" 2297: 2271:Journal of Symbolic Computation 2259: 2234: 2193: 2154: 2138: 2105: 2065: 2042: 2022: 2006: 1994: 1955:Journal of Symbolic Computation 1688:Multivariate division algorithm 348:Journal of Symbolic Computation 3024:Network performance evaluation 2345:"Factorization of Polynomials" 2241:Wexelblat, Richard L. (1981). 2029:Cassidy, Kevin G. (Dec 1985). 1981: 1942: 1918: 1907: 1874: 1849: 1838: 1800: 1786: 1390: 1377: 1335: 1316: 1290: 1278: 1243: 1239: 1220: 1202: 1189: 1180: 1113: 1110: 1059: 1056: 1044: 967: 958: 945: 454: 258: 13: 1: 3395:Multimedia information system 3380:Geographic information system 3370:Enterprise information system 2959:Computer systems organization 2418:10.1016/S0747-7171(85)80025-0 2283:10.1016/S0747-7171(85)80025-0 2200:McCarthy, John (1960-04-01). 1779: 1562:primitive recursive functions 1507:Human-driven computer algebra 1341:{\displaystyle \log(z^{2}-5)} 1265:is viewed as a polynomial in 3754:Computational social science 3342:Theoretical computer science 3155:Software development process 2931:Electronic design automation 2916:Very Large Scale Integration 1857:"SIGSAM list of conferences" 1764:Symbolic-numeric computation 1698:Pollard's kangaroo algorithm 7: 3577:Natural language processing 3365:Information storage systems 2749:Engineering Equation Solver 2357:10.1007/978-3-7091-7551-4_8 2163:"When Computers Were Women" 2161:Light, Jennifer S. (1999). 2089:10.1007/978-3-7091-7551-4_2 1722: 1660:Cantor–Zassenhaus algorithm 1630:unique factorization domain 1350: 10: 4503: 4393:Films about mathematicians 3493:Human–computer interaction 3463:Intrusion detection system 3375:Social information systems 3360:Database management system 2074:"Algebraic simplification" 1640: 1517:University of Pennsylvania 1501: 388: 4416: 4366: 4323: 4233: 4195: 4162: 4114: 4086: 4033: 3980: 3962:Philosophy of mathematics 3937: 3902: 3822: 3759:Computational engineering 3734:Computational mathematics 3711: 3658: 3620: 3567: 3529: 3491: 3433: 3350: 3296: 3258: 3203: 3140: 3073: 3037: 2994: 2958: 2891: 2880: 2808: 2757: 2689: 2586: 2524:10.1007/978-3-7091-7551-4 2206:Communications of the ACM 1967:10.1016/j.jsc.2007.04.006 1807:Watt, Stephen M. (2006). 1694:in several indeterminates 1560:explored an extension of 1296:{\displaystyle \sin(x+y)} 741:A difficulty occurs with 263:Some authors distinguish 4398:Recreational mathematics 3769:Computational healthcare 3764:Differentiable computing 3683:Graphics processing unit 3102:Domain-specific language 2971:Computational complexity 2580:Computer algebra systems 1729:Automated theorem prover 1704:Polynomial long division 1357:mathematical expressions 1157:mathematical expressions 1145:Polynomial factorization 936:trigonometric identities 433:computer algebra systems 359:Computer science aspects 237:polynomial factorization 208:computer algebra systems 173:mathematical expressions 4283:Mathematical statistics 4273:Mathematical psychology 4243:Engineering mathematics 4177:Algebraic number theory 3744:Computational chemistry 3678:Photograph manipulation 3569:Artificial intelligence 3385:Decision support system 2454:Modern computer algebra 2322:10.1145/1088322.1088325 2019:. Retrieved 2023-11-29. 1914:SIGSAM list of journals 1881:Cohen, Joel S. (2003). 1744:Computer algebra system 1734:Computer-assisted proof 805:are both simplified to 485:mathematical expression 249:public key cryptography 4429:Mathematics portal 4278:Mathematical sociology 4258:Mathematical economics 4253:Mathematical chemistry 4182:Analytic number theory 4063:Differential equations 3809:Educational technology 3640:Reinforcement learning 3390:Process control system 3288:Computational geometry 3278:Algorithmic efficiency 3273:Analysis of algorithms 2921:Systems on Chip (SoCs) 2735:symbolic math toolbox) 2277:(1): 1–6. 1985-03-01. 2179:10.1353/tech.1999.0128 2167:Technology and Culture 1930:homepages.math.uic.edu 1651:Buchberger's algorithm 1578:Stanford AI Laboratory 1444: 1342: 1297: 1256: 1136: 1031: 743:associative operations 707: 596: 472: 325:special interest group 297:algebraic manipulation 241:indefinite integration 189:floating point numbers 140: 4408:Mathematics education 4338:Theory of computation 4058:Hypercomplex analysis 3779:Electronic publishing 3749:Computational biology 3739:Computational physics 3635:Unsupervised learning 3549:Distributed computing 3425:Information retrieval 3332:Mathematical analysis 3322:Mathematical software 3205:Theory of computation 3170:Software construction 3160:Requirements analysis 3038:Software organization 2966:Computer architecture 2936:Hardware acceleration 2901:Printed circuit board 2219:10.1145/367177.367199 1889:. AK Peters. p.  1749:Differential analyser 1445: 1343: 1298: 1257: 1137: 1032: 821:, which is displayed 708: 597: 595:{\displaystyle a^{x}} 462: 426:irreducible fractions 395:numerical computation 374:numerical computation 293:symbolic manipulation 185:numerical computation 161:algebraic computation 83: 4388:Informal mathematics 4268:Mathematical physics 4263:Mathematical finance 4248:Mathematical biology 4187:Diophantine geometry 3539:Concurrent computing 3511:Ubiquitous computing 3483:Application security 3478:Information security 3307:Discrete mathematics 3283:Randomized algorithm 3235:Computability theory 3213:Model of computation 3185:Software maintenance 3180:Software engineering 3142:Software development 3092:Programming language 3087:Programming paradigm 3004:Network architecture 2061:. 1996. p. 419. 1845:SIGSAM official site 1666:Faugère F4 algorithm 1610:efficient algorithms 1455:Richardson's theorem 1374: 1307: 1269: 1177: 1168:irrational functions 1151:Mathematical aspects 1041: 942: 609: 579: 315:Scientific community 305:symbolic mathematics 277:symbolic computation 269:symbolic computation 217:programming language 181:scientific computing 177:mathematical objects 157:symbolic computation 85:Symbolic integration 4403:Mathematics and art 4313:Operations research 4068:Functional analysis 3814:Document management 3804:Operations research 3729:Enterprise software 3645:Multi-task learning 3630:Supervised learning 3352:Information systems 3175:Software deployment 3132:Software repository 2986:Real-time computing 2485:1992afca.book.....G 2431:Davenport, James H. 2310:ACM SIGSAM Bulletin 1769:Symbolic simulation 1582:Stanford University 364:Data representation 351:founded in 1985 by 301:symbolic processing 275:. Some authors use 4348:Numerical analysis 3957:Mathematical logic 3952:Information theory 3597:Search methodology 3544:Parallel computing 3501:Interaction design 3410:Computing platform 3337:Numerical analysis 3327:Information theory 3112:Software framework 3075:Software notations 3014:Network components 2911:Integrated circuit 1672:Gosper's algorithm 1618:Euclid's algorithm 1548:led said efforts. 1464:rational fractions 1440: 1361:Syntactic equality 1338: 1293: 1252: 1164:rational fractions 1132: 1027: 876:as, respectively, 759:is represented as 703: 602:gives the result 592: 575:on the expression 549:) or entries in a 473: 447:, which is thus a 414:base of numeration 370:numerical software 141: 89:algebraic function 18:Syntactic equality 4474: 4473: 4073:Harmonic analysis 3860: 3859: 3789:Electronic voting 3719:Quantum Computing 3712:Applied computing 3698:Image compression 3468:Hardware security 3458:Security services 3415:Digital marketing 3195:Open-source model 3107:Modeling language 3019:Network scheduler 2840: 2839: 2533:978-3-211-81776-6 2502:978-0-7923-9259-0 2444:978-0-12-204230-0 2393:Buchberger, Bruno 2366:978-3-211-81776-6 2252:978-0-12-745040-7 2098:978-3-211-81776-6 1900:978-1-56881-159-8 1608:while developing 1596:Historic problems 1453:It is known from 1365:Semantic equality 693: 465:(8 − 6) × (3 + 1) 428:of two integers. 187:with approximate 171:for manipulating 78: 77: 70: 16:(Redirected from 4494: 4487:Computer algebra 4462: 4461: 4450: 4449: 4438: 4437: 4427: 4426: 4358:Computer algebra 4333:Computer science 4053:Complex analysis 3887: 3880: 3873: 3864: 3863: 3850: 3849: 3840: 3839: 3830: 3829: 3650:Cross-validation 3622:Machine learning 3506:Social computing 3473:Network security 3268:Algorithm design 3190:Programming team 3150:Control variable 3127:Software library 3065:Software quality 3060:Operating system 3009:Network protocol 2874:Computer science 2867: 2860: 2853: 2844: 2843: 2828: 2827: 2816: 2815: 2699:ClassPad Manager 2573: 2566: 2559: 2550: 2549: 2545: 2517: 2506: 2478: 2467: 2448: 2421: 2401: 2376: 2375: 2374: 2373: 2349:Computer Algebra 2340: 2334: 2333: 2301: 2295: 2294: 2263: 2257: 2256: 2238: 2232: 2231: 2221: 2197: 2191: 2190: 2158: 2152: 2142: 2136: 2135: 2109: 2103: 2102: 2078: 2069: 2063: 2062: 2056: 2046: 2040: 2039: 2037: 2026: 2020: 2010: 2004: 1998: 1992: 1989:Expression swell 1985: 1979: 1978: 1946: 1940: 1939: 1937: 1936: 1922: 1916: 1911: 1905: 1904: 1888: 1878: 1872: 1871: 1869: 1868: 1859:. Archived from 1853: 1847: 1842: 1836: 1835: 1815: 1804: 1798: 1797: 1790: 1626:ring of integers 1604:to increase its 1449: 1447: 1446: 1441: 1436: 1435: 1411: 1410: 1398: 1397: 1347: 1345: 1344: 1339: 1328: 1327: 1302: 1300: 1299: 1294: 1261: 1259: 1258: 1253: 1251: 1250: 1232: 1231: 1210: 1209: 1141: 1139: 1138: 1133: 1125: 1124: 1097: 1096: 1084: 1083: 1071: 1070: 1036: 1034: 1033: 1028: 1011: 1010: 995: 994: 979: 978: 966: 965: 902: 892: 882: 875: 865: 855: 848: 834: 820: 804: 789: 774: 758: 737: 733: 712: 710: 709: 704: 699: 695: 694: 686: 652: 651: 633: 632: 601: 599: 598: 593: 591: 590: 574: 569:with respect to 533: 527: 517: 511: 505: 466: 422:rational numbers 383:expression swell 353:Bruno Buchberger 309:symbolic algebra 265:computer algebra 211:, with the term 153:computer algebra 149:computer science 133: 132: 130: 129: 128: 127: 110: 107: 73: 66: 62: 59: 53: 38: 37: 30: 21: 4502: 4501: 4497: 4496: 4495: 4493: 4492: 4491: 4477: 4476: 4475: 4470: 4421: 4412: 4362: 4319: 4298:Systems science 4229: 4225:Homotopy theory 4191: 4158: 4110: 4082: 4029: 3976: 3947:Category theory 3933: 3898: 3891: 3861: 3856: 3847: 3818: 3799:Word processing 3707: 3693:Virtual reality 3654: 3616: 3587:Computer vision 3563: 3559:Multiprocessing 3525: 3487: 3453:Security hacker 3429: 3405:Digital library 3346: 3297:Mathematics of 3292: 3254: 3230:Automata theory 3225:Formal language 3199: 3165:Software design 3136: 3069: 3055:Virtual machine 3033: 3029:Network service 2990: 2981:Embedded system 2954: 2887: 2876: 2871: 2841: 2836: 2804: 2753: 2744:TI InterActive! 2685: 2582: 2577: 2534: 2503: 2493:10.1007/b102438 2464: 2445: 2399: 2385: 2383:Further reading 2380: 2379: 2371: 2369: 2367: 2341: 2337: 2302: 2298: 2265: 2264: 2260: 2253: 2239: 2235: 2198: 2194: 2159: 2155: 2143: 2139: 2124: 2110: 2106: 2099: 2076: 2070: 2066: 2054: 2048: 2047: 2043: 2035: 2027: 2023: 2011: 2007: 1999: 1995: 1986: 1982: 1947: 1943: 1934: 1932: 1924: 1923: 1919: 1912: 1908: 1901: 1879: 1875: 1866: 1864: 1855: 1854: 1850: 1843: 1839: 1824: 1813: 1805: 1801: 1792: 1791: 1787: 1782: 1725: 1720: 1719: 1714:antiderivatives 1710:Risch algorithm 1646: 1638: 1598: 1554: 1534:Ruth Lichterman 1521:human computers 1509: 1504: 1431: 1427: 1406: 1402: 1393: 1389: 1375: 1372: 1371: 1353: 1323: 1319: 1308: 1305: 1304: 1270: 1267: 1266: 1246: 1242: 1227: 1223: 1205: 1201: 1178: 1175: 1174: 1153: 1120: 1116: 1092: 1088: 1079: 1075: 1066: 1062: 1042: 1039: 1038: 1006: 1002: 990: 986: 974: 970: 961: 957: 943: 940: 939: 894: 884: 877: 867: 857: 850: 836: 822: 806: 791: 776: 760: 746: 735: 724: 721:rewriting rules 685: 660: 656: 647: 643: 622: 618: 610: 607: 606: 586: 582: 580: 577: 576: 570: 567:differentiation 563: 529: 523: 513: 507: 497: 464: 457: 391: 366: 361: 321:learned society 317: 261: 229:differentiation 114: 112: 111: 108: 103: 102: 100: 91: 74: 63: 57: 54: 51: 43:This article's 39: 35: 28: 23: 22: 15: 12: 11: 5: 4500: 4490: 4489: 4472: 4471: 4469: 4468: 4456: 4444: 4432: 4417: 4414: 4413: 4411: 4410: 4405: 4400: 4395: 4390: 4385: 4384: 4383: 4376:Mathematicians 4372: 4370: 4368:Related topics 4364: 4363: 4361: 4360: 4355: 4350: 4345: 4340: 4335: 4329: 4327: 4321: 4320: 4318: 4317: 4316: 4315: 4310: 4305: 4303:Control theory 4295: 4290: 4285: 4280: 4275: 4270: 4265: 4260: 4255: 4250: 4245: 4239: 4237: 4231: 4230: 4228: 4227: 4222: 4217: 4212: 4207: 4201: 4199: 4193: 4192: 4190: 4189: 4184: 4179: 4174: 4168: 4166: 4160: 4159: 4157: 4156: 4151: 4146: 4141: 4136: 4131: 4126: 4120: 4118: 4112: 4111: 4109: 4108: 4103: 4098: 4092: 4090: 4084: 4083: 4081: 4080: 4078:Measure theory 4075: 4070: 4065: 4060: 4055: 4050: 4045: 4039: 4037: 4031: 4030: 4028: 4027: 4022: 4017: 4012: 4007: 4002: 3997: 3992: 3986: 3984: 3978: 3977: 3975: 3974: 3969: 3964: 3959: 3954: 3949: 3943: 3941: 3935: 3934: 3932: 3931: 3926: 3921: 3920: 3919: 3914: 3903: 3900: 3899: 3890: 3889: 3882: 3875: 3867: 3858: 3857: 3855: 3854: 3844: 3834: 3823: 3820: 3819: 3817: 3816: 3811: 3806: 3801: 3796: 3791: 3786: 3781: 3776: 3771: 3766: 3761: 3756: 3751: 3746: 3741: 3736: 3731: 3726: 3721: 3715: 3713: 3709: 3708: 3706: 3705: 3703:Solid modeling 3700: 3695: 3690: 3685: 3680: 3675: 3670: 3664: 3662: 3656: 3655: 3653: 3652: 3647: 3642: 3637: 3632: 3626: 3624: 3618: 3617: 3615: 3614: 3609: 3604: 3602:Control method 3599: 3594: 3589: 3584: 3579: 3573: 3571: 3565: 3564: 3562: 3561: 3556: 3554:Multithreading 3551: 3546: 3541: 3535: 3533: 3527: 3526: 3524: 3523: 3518: 3513: 3508: 3503: 3497: 3495: 3489: 3488: 3486: 3485: 3480: 3475: 3470: 3465: 3460: 3455: 3450: 3448:Formal methods 3445: 3439: 3437: 3431: 3430: 3428: 3427: 3422: 3420:World Wide Web 3417: 3412: 3407: 3402: 3397: 3392: 3387: 3382: 3377: 3372: 3367: 3362: 3356: 3354: 3348: 3347: 3345: 3344: 3339: 3334: 3329: 3324: 3319: 3314: 3309: 3303: 3301: 3294: 3293: 3291: 3290: 3285: 3280: 3275: 3270: 3264: 3262: 3256: 3255: 3253: 3252: 3247: 3242: 3237: 3232: 3227: 3222: 3221: 3220: 3209: 3207: 3201: 3200: 3198: 3197: 3192: 3187: 3182: 3177: 3172: 3167: 3162: 3157: 3152: 3146: 3144: 3138: 3137: 3135: 3134: 3129: 3124: 3119: 3114: 3109: 3104: 3099: 3094: 3089: 3083: 3081: 3071: 3070: 3068: 3067: 3062: 3057: 3052: 3047: 3041: 3039: 3035: 3034: 3032: 3031: 3026: 3021: 3016: 3011: 3006: 3000: 2998: 2992: 2991: 2989: 2988: 2983: 2978: 2973: 2968: 2962: 2960: 2956: 2955: 2953: 2952: 2943: 2938: 2933: 2928: 2923: 2918: 2913: 2908: 2903: 2897: 2895: 2889: 2888: 2881: 2878: 2877: 2870: 2869: 2862: 2855: 2847: 2838: 2837: 2835: 2834: 2822: 2809: 2806: 2805: 2803: 2802: 2797: 2792: 2787: 2782: 2777: 2772: 2767: 2761: 2759: 2755: 2754: 2752: 2751: 2746: 2741: 2736: 2726: 2721: 2716: 2711: 2706: 2701: 2695: 2693: 2687: 2686: 2684: 2683: 2678: 2673: 2668: 2663: 2658: 2653: 2648: 2643: 2638: 2633: 2628: 2623: 2618: 2613: 2608: 2603: 2598: 2592: 2590: 2584: 2583: 2576: 2575: 2568: 2561: 2553: 2547: 2546: 2532: 2507: 2501: 2468: 2462: 2449: 2443: 2423: 2422: 2384: 2381: 2378: 2377: 2365: 2335: 2296: 2258: 2251: 2233: 2212:(4): 184–195. 2192: 2173:(3): 455–483. 2153: 2137: 2122: 2104: 2097: 2064: 2041: 2021: 2005: 1993: 1987:Richard Liska 1980: 1961:(3): 261–270. 1941: 1917: 1906: 1899: 1873: 1848: 1837: 1822: 1799: 1784: 1783: 1781: 1778: 1777: 1776: 1771: 1766: 1761: 1756: 1751: 1746: 1741: 1736: 1731: 1724: 1721: 1718: 1717: 1707: 1701: 1695: 1685: 1675: 1669: 1663: 1657: 1647: 1639: 1637: 1634: 1622:linear algebra 1597: 1594: 1553: 1550: 1530:Marlyn Wescoff 1508: 1505: 1503: 1500: 1496:distributivity 1484:canonical form 1472:canonical form 1451: 1450: 1439: 1434: 1430: 1426: 1423: 1420: 1417: 1414: 1409: 1405: 1401: 1396: 1392: 1388: 1385: 1382: 1379: 1352: 1349: 1337: 1334: 1331: 1326: 1322: 1318: 1315: 1312: 1292: 1289: 1286: 1283: 1280: 1277: 1274: 1263: 1262: 1249: 1245: 1241: 1238: 1235: 1230: 1226: 1222: 1219: 1216: 1213: 1208: 1204: 1200: 1197: 1194: 1191: 1188: 1185: 1182: 1152: 1149: 1131: 1128: 1123: 1119: 1115: 1112: 1109: 1106: 1103: 1100: 1095: 1091: 1087: 1082: 1078: 1074: 1069: 1065: 1061: 1058: 1055: 1052: 1049: 1046: 1026: 1023: 1020: 1017: 1014: 1009: 1005: 1001: 998: 993: 989: 985: 982: 977: 973: 969: 964: 960: 956: 953: 950: 947: 932:distributivity 714: 713: 702: 698: 692: 689: 684: 681: 678: 675: 672: 669: 666: 663: 659: 655: 650: 646: 642: 639: 636: 631: 628: 625: 621: 617: 614: 589: 585: 562: 561:Simplification 559: 456: 453: 399:floating point 390: 387: 365: 362: 360: 357: 316: 313: 286:formal methods 260: 257: 251:, or for some 221:user interface 155:, also called 76: 75: 42: 40: 33: 26: 9: 6: 4: 3: 2: 4499: 4488: 4485: 4484: 4482: 4467: 4466: 4457: 4455: 4454: 4445: 4443: 4442: 4433: 4431: 4430: 4425: 4419: 4418: 4415: 4409: 4406: 4404: 4401: 4399: 4396: 4394: 4391: 4389: 4386: 4382: 4379: 4378: 4377: 4374: 4373: 4371: 4369: 4365: 4359: 4356: 4354: 4351: 4349: 4346: 4344: 4341: 4339: 4336: 4334: 4331: 4330: 4328: 4326: 4325:Computational 4322: 4314: 4311: 4309: 4306: 4304: 4301: 4300: 4299: 4296: 4294: 4291: 4289: 4286: 4284: 4281: 4279: 4276: 4274: 4271: 4269: 4266: 4264: 4261: 4259: 4256: 4254: 4251: 4249: 4246: 4244: 4241: 4240: 4238: 4236: 4232: 4226: 4223: 4221: 4218: 4216: 4213: 4211: 4208: 4206: 4203: 4202: 4200: 4198: 4194: 4188: 4185: 4183: 4180: 4178: 4175: 4173: 4170: 4169: 4167: 4165: 4164:Number theory 4161: 4155: 4152: 4150: 4147: 4145: 4142: 4140: 4137: 4135: 4132: 4130: 4127: 4125: 4122: 4121: 4119: 4117: 4113: 4107: 4104: 4102: 4099: 4097: 4096:Combinatorics 4094: 4093: 4091: 4089: 4085: 4079: 4076: 4074: 4071: 4069: 4066: 4064: 4061: 4059: 4056: 4054: 4051: 4049: 4048:Real analysis 4046: 4044: 4041: 4040: 4038: 4036: 4032: 4026: 4023: 4021: 4018: 4016: 4013: 4011: 4008: 4006: 4003: 4001: 3998: 3996: 3993: 3991: 3988: 3987: 3985: 3983: 3979: 3973: 3970: 3968: 3965: 3963: 3960: 3958: 3955: 3953: 3950: 3948: 3945: 3944: 3942: 3940: 3936: 3930: 3927: 3925: 3922: 3918: 3915: 3913: 3910: 3909: 3908: 3905: 3904: 3901: 3896: 3888: 3883: 3881: 3876: 3874: 3869: 3868: 3865: 3853: 3845: 3843: 3835: 3833: 3825: 3824: 3821: 3815: 3812: 3810: 3807: 3805: 3802: 3800: 3797: 3795: 3792: 3790: 3787: 3785: 3782: 3780: 3777: 3775: 3772: 3770: 3767: 3765: 3762: 3760: 3757: 3755: 3752: 3750: 3747: 3745: 3742: 3740: 3737: 3735: 3732: 3730: 3727: 3725: 3722: 3720: 3717: 3716: 3714: 3710: 3704: 3701: 3699: 3696: 3694: 3691: 3689: 3688:Mixed reality 3686: 3684: 3681: 3679: 3676: 3674: 3671: 3669: 3666: 3665: 3663: 3661: 3657: 3651: 3648: 3646: 3643: 3641: 3638: 3636: 3633: 3631: 3628: 3627: 3625: 3623: 3619: 3613: 3610: 3608: 3605: 3603: 3600: 3598: 3595: 3593: 3590: 3588: 3585: 3583: 3580: 3578: 3575: 3574: 3572: 3570: 3566: 3560: 3557: 3555: 3552: 3550: 3547: 3545: 3542: 3540: 3537: 3536: 3534: 3532: 3528: 3522: 3521:Accessibility 3519: 3517: 3516:Visualization 3514: 3512: 3509: 3507: 3504: 3502: 3499: 3498: 3496: 3494: 3490: 3484: 3481: 3479: 3476: 3474: 3471: 3469: 3466: 3464: 3461: 3459: 3456: 3454: 3451: 3449: 3446: 3444: 3441: 3440: 3438: 3436: 3432: 3426: 3423: 3421: 3418: 3416: 3413: 3411: 3408: 3406: 3403: 3401: 3398: 3396: 3393: 3391: 3388: 3386: 3383: 3381: 3378: 3376: 3373: 3371: 3368: 3366: 3363: 3361: 3358: 3357: 3355: 3353: 3349: 3343: 3340: 3338: 3335: 3333: 3330: 3328: 3325: 3323: 3320: 3318: 3315: 3313: 3310: 3308: 3305: 3304: 3302: 3300: 3295: 3289: 3286: 3284: 3281: 3279: 3276: 3274: 3271: 3269: 3266: 3265: 3263: 3261: 3257: 3251: 3248: 3246: 3243: 3241: 3238: 3236: 3233: 3231: 3228: 3226: 3223: 3219: 3216: 3215: 3214: 3211: 3210: 3208: 3206: 3202: 3196: 3193: 3191: 3188: 3186: 3183: 3181: 3178: 3176: 3173: 3171: 3168: 3166: 3163: 3161: 3158: 3156: 3153: 3151: 3148: 3147: 3145: 3143: 3139: 3133: 3130: 3128: 3125: 3123: 3120: 3118: 3115: 3113: 3110: 3108: 3105: 3103: 3100: 3098: 3095: 3093: 3090: 3088: 3085: 3084: 3082: 3080: 3076: 3072: 3066: 3063: 3061: 3058: 3056: 3053: 3051: 3048: 3046: 3043: 3042: 3040: 3036: 3030: 3027: 3025: 3022: 3020: 3017: 3015: 3012: 3010: 3007: 3005: 3002: 3001: 2999: 2997: 2993: 2987: 2984: 2982: 2979: 2977: 2976:Dependability 2974: 2972: 2969: 2967: 2964: 2963: 2961: 2957: 2951: 2947: 2944: 2942: 2939: 2937: 2934: 2932: 2929: 2927: 2924: 2922: 2919: 2917: 2914: 2912: 2909: 2907: 2904: 2902: 2899: 2898: 2896: 2894: 2890: 2885: 2879: 2875: 2868: 2863: 2861: 2856: 2854: 2849: 2848: 2845: 2833: 2832: 2823: 2821: 2820: 2811: 2810: 2807: 2801: 2798: 2796: 2793: 2791: 2788: 2786: 2783: 2781: 2778: 2776: 2773: 2771: 2768: 2766: 2763: 2762: 2760: 2756: 2750: 2747: 2745: 2742: 2740: 2737: 2734: 2730: 2727: 2725: 2722: 2720: 2717: 2715: 2712: 2710: 2707: 2705: 2702: 2700: 2697: 2696: 2694: 2692: 2688: 2682: 2679: 2677: 2674: 2672: 2669: 2667: 2664: 2662: 2659: 2657: 2654: 2652: 2649: 2647: 2644: 2642: 2639: 2637: 2634: 2632: 2629: 2627: 2624: 2622: 2619: 2617: 2614: 2612: 2609: 2607: 2604: 2602: 2599: 2597: 2594: 2593: 2591: 2589: 2585: 2581: 2574: 2569: 2567: 2562: 2560: 2555: 2554: 2551: 2543: 2539: 2535: 2529: 2525: 2521: 2516: 2515: 2508: 2504: 2498: 2494: 2490: 2486: 2482: 2477: 2476: 2469: 2465: 2463:0-521-82646-2 2459: 2455: 2450: 2446: 2440: 2436: 2432: 2428: 2427: 2426: 2419: 2415: 2411: 2407: 2406: 2398: 2394: 2390: 2389: 2388: 2368: 2362: 2358: 2354: 2350: 2346: 2339: 2331: 2327: 2323: 2319: 2315: 2311: 2307: 2300: 2292: 2288: 2284: 2280: 2276: 2272: 2268: 2262: 2254: 2248: 2244: 2237: 2229: 2225: 2220: 2215: 2211: 2207: 2203: 2196: 2188: 2184: 2180: 2176: 2172: 2168: 2164: 2157: 2150: 2146: 2141: 2133: 2129: 2125: 2123:0-12-204230-1 2119: 2115: 2108: 2100: 2094: 2090: 2086: 2082: 2075: 2068: 2060: 2053: 2052: 2045: 2034: 2033: 2025: 2018: 2014: 2009: 2002: 1997: 1990: 1984: 1976: 1972: 1968: 1964: 1960: 1956: 1952: 1945: 1931: 1927: 1921: 1915: 1910: 1902: 1896: 1892: 1887: 1886: 1877: 1863:on 2013-08-08 1862: 1858: 1852: 1846: 1841: 1833: 1829: 1825: 1823:9788468983813 1819: 1812: 1811: 1803: 1795: 1789: 1785: 1775: 1772: 1770: 1767: 1765: 1762: 1760: 1759:Model checker 1757: 1755: 1754:Proof checker 1752: 1750: 1747: 1745: 1742: 1740: 1737: 1735: 1732: 1730: 1727: 1726: 1715: 1711: 1708: 1705: 1702: 1699: 1696: 1693: 1689: 1686: 1683: 1679: 1676: 1673: 1670: 1667: 1664: 1661: 1658: 1656: 1655:Gröbner basis 1652: 1649: 1648: 1644: 1633: 1631: 1627: 1623: 1619: 1615: 1611: 1607: 1606:effectiveness 1603: 1593: 1591: 1585: 1583: 1579: 1575: 1571: 1567: 1563: 1559: 1558:John McCarthy 1549: 1547: 1543: 1542:Frances Bilas 1539: 1535: 1531: 1527: 1526:Jean Jennings 1522: 1518: 1514: 1499: 1497: 1491: 1489: 1485: 1480: 1478: 1474: 1473: 1467: 1465: 1461: 1456: 1437: 1432: 1428: 1424: 1421: 1418: 1415: 1412: 1407: 1403: 1399: 1394: 1386: 1383: 1380: 1370: 1369: 1368: 1366: 1362: 1358: 1348: 1332: 1329: 1324: 1320: 1313: 1310: 1287: 1284: 1281: 1275: 1272: 1247: 1236: 1233: 1228: 1224: 1217: 1214: 1211: 1206: 1198: 1195: 1192: 1186: 1183: 1173: 1172: 1171: 1169: 1165: 1162: 1158: 1148: 1146: 1129: 1126: 1121: 1117: 1107: 1104: 1101: 1098: 1093: 1089: 1085: 1080: 1076: 1072: 1067: 1063: 1053: 1050: 1047: 1024: 1021: 1018: 1015: 1012: 1007: 1003: 999: 996: 991: 987: 983: 980: 975: 971: 962: 954: 951: 948: 937: 933: 928: 925: 924:hash function 921: 917: 913: 909: 908:commutativity 904: 901: 897: 891: 888:+ (−1)⋅ 887: 881: 874: 870: 864: 860: 854: 847: 843: 839: 833: 829: 825: 818: 814: 810: 803: 799: 795: 787: 783: 779: 772: 768: 764: 757: 753: 749: 744: 739: 731: 727: 722: 717: 700: 696: 690: 687: 682: 679: 676: 673: 670: 667: 664: 661: 657: 653: 648: 644: 640: 637: 634: 629: 626: 623: 619: 615: 612: 605: 604: 603: 587: 583: 573: 568: 558: 556: 552: 548: 544: 539: 535: 532: 526: 521: 516: 510: 504: 500: 493: 490: 486: 482: 478: 470: 461: 452: 450: 446: 442: 438: 434: 429: 427: 423: 419: 415: 411: 406: 404: 400: 396: 386: 384: 379: 375: 371: 356: 354: 350: 349: 343: 341: 336: 334: 330: 326: 322: 312: 310: 306: 302: 298: 294: 289: 287: 283: 282:calcul formel 278: 274: 270: 266: 256: 254: 250: 244: 242: 238: 234: 230: 226: 222: 218: 214: 210: 209: 204: 200: 198: 194: 190: 186: 182: 178: 174: 170: 166: 162: 158: 154: 150: 146: 139: 138: 125: 121: 117: 106: 98: 94: 90: 86: 82: 72: 69: 61: 49: 47: 41: 32: 31: 19: 4463: 4451: 4439: 4420: 4357: 4353:Optimization 4215:Differential 4139:Differential 4106:Order theory 4101:Graph theory 4005:Group theory 3784:Cyberwarfare 3443:Cryptography 2829: 2817: 2758:Discontinued 2739:SMath Studio 2513: 2474: 2453: 2434: 2424: 2409: 2403: 2386: 2370:, retrieved 2348: 2338: 2316:(4): 12–20. 2313: 2309: 2299: 2274: 2270: 2261: 2242: 2236: 2209: 2205: 2195: 2170: 2166: 2156: 2148: 2140: 2116:. Academic. 2113: 2107: 2080: 2067: 2050: 2044: 2031: 2024: 2008: 1996: 1983: 1958: 1954: 1944: 1933:. Retrieved 1929: 1920: 1909: 1884: 1876: 1865:. Retrieved 1861:the original 1851: 1840: 1809: 1802: 1788: 1684:rule systems 1599: 1586: 1555: 1538:Betty Snyder 1519:, relied on 1510: 1492: 1487: 1483: 1481: 1476: 1470: 1468: 1452: 1364: 1360: 1354: 1264: 1161:multivariate 1154: 929: 905: 899: 895: 889: 885: 879: 872: 868: 862: 858: 852: 845: 841: 837: 831: 827: 823: 816: 812: 808: 801: 797: 793: 785: 781: 777: 770: 766: 762: 755: 751: 747: 740: 729: 725: 718: 715: 571: 564: 540: 536: 530: 524: 519: 514: 508: 502: 498: 494: 474: 448: 430: 424:, which are 418:machine word 407: 401:numbers and 392: 382: 377: 367: 346: 344: 337: 319:There is no 318: 308: 304: 300: 296: 292: 290: 281: 276: 268: 264: 262: 245: 212: 206: 201: 192: 160: 156: 152: 142: 135: 123: 119: 115: 104: 96: 92: 64: 55: 46:lead section 44: 4465:WikiProject 4308:Game theory 4288:Probability 4025:Homological 4015:Multilinear 3995:Commutative 3972:Type theory 3939:Foundations 3895:mathematics 3794:Video games 3774:Digital art 3531:Concurrency 3400:Data mining 3312:Probability 3045:Interpreter 2724:Mathematica 2691:Proprietary 2588:Open-source 1692:polynomials 1574:Project MAC 1546:Kay McNulty 1488:normal form 1477:normal form 1460:polynomials 878:(−1)⋅ 475:Except for 455:Expressions 445:GMP library 437:Mathematica 259:Terminology 145:mathematics 4293:Statistics 4172:Arithmetic 4134:Arithmetic 4000:Elementary 3967:Set theory 3852:Glossaries 3724:E-commerce 3317:Statistics 3260:Algorithms 3218:Stochastic 3050:Middleware 2906:Peripheral 2790:Mathomatic 2412:(1): 1–6. 2372:2023-11-29 1935:2024-03-31 1867:2012-11-15 1780:References 1653:: finds a 1580:(SAIL) at 912:like terms 736:sin(0) → 0 551:hash table 520:evaluating 451:standard. 443:, use the 255:problems. 253:non-linear 233:chain rule 231:using the 175:and other 165:algorithms 4220:Geometric 4210:Algebraic 4149:Euclidean 4124:Algebraic 4020:Universal 3673:Rendering 3668:Animation 3299:computing 3250:Semantics 2941:Processor 2676:Xcas/Giac 2636:Macaulay2 2330:0163-5824 2291:0747-7171 2228:0001-0782 2187:1097-3729 2132:802584470 2017:Maplesoft 1975:0747-7171 1832:496720771 1682:rewriting 1556:In 1960, 1330:− 1314:⁡ 1276:⁡ 1234:− 1218:⁡ 1187:⁡ 1127:− 1114:→ 1051:− 968:→ 683:⋅ 671:⁡ 665:⋅ 654:⋅ 635:⋅ 627:− 616:⋅ 553:(like in 545:(like in 481:variables 197:variables 4481:Category 4441:Category 4197:Topology 4144:Discrete 4129:Analytic 4116:Geometry 4088:Discrete 4043:Calculus 4035:Analysis 3990:Abstract 3929:Glossary 3912:Timeline 3832:Category 3660:Graphics 3435:Security 3097:Compiler 2996:Networks 2893:Hardware 2819:Category 2780:LiveMath 2666:Singular 2661:SageMath 2646:Normaliz 2395:(1985). 1723:See also 1351:Equality 861:− 840:− 728:− 543:pointers 489:sequence 483:, every 449:de facto 412:in some 403:integers 273:formulas 225:routines 203:Software 169:software 58:May 2020 4453:Commons 4235:Applied 4205:General 3982:Algebra 3907:History 3842:Outline 2785:Macsyma 2719:Mathcad 2651:PARI/GP 2601:Cadabra 2542:5221892 2481:Bibcode 2059:Macsyma 1602:algebra 1515:at the 1502:History 916:Macsyma 851:− 775:. Thus 547:Macsyma 477:numbers 389:Numbers 327:of the 243:, etc. 131:⁠ 113:√ 101:⁠ 87:of the 4154:Finite 4010:Linear 3917:Future 3893:Major 2800:ALTRAN 2795:muMATH 2775:Erable 2770:Derive 2733:MATLAB 2656:Reduce 2641:Maxima 2616:FriCAS 2611:Fermat 2540:  2530:  2499:  2460:  2441:  2363:  2328:  2289:  2249:  2226:  2185:  2130:  2120:  2095:  1973:  1897:  1830:  1820:  1690:: for 1680:: for 1590:ALTRAN 1544:, and 410:digits 333:SIGSAM 331:named 213:system 4381:lists 3924:Lists 3897:areas 3245:Logic 3079:tools 2765:CAMAL 2729:muPAD 2714:Maple 2709:Magma 2681:Yacas 2671:SymPy 2631:GiNaC 2606:CoCoA 2596:Axiom 2538:S2CID 2400:(PDF) 2077:(PDF) 2055:(PDF) 2036:(PDF) 1814:(PDF) 1628:or a 1513:ENIAC 920:Maple 555:Maple 467:as a 441:Maple 378:exact 340:ISSAC 307:, or 267:from 193:exact 137:Axiom 3077:and 2950:Form 2946:Size 2831:List 2704:KANT 2621:FORM 2528:ISBN 2497:ISBN 2458:ISBN 2439:ISBN 2361:ISBN 2326:ISSN 2287:ISSN 2247:ISBN 2224:ISSN 2183:ISSN 2128:OCLC 2118:ISBN 2093:ISBN 1971:ISSN 1895:ISBN 1828:OCLC 1818:ISBN 1566:Lisp 1462:and 1303:and 1037:and 922:, a 807:"+"( 800:) + 790:and 761:"+"( 528:and 512:and 479:and 469:Lisp 439:and 397:are 167:and 147:and 126:− 71 122:− 96 118:+ 10 99:) = 2626:GAP 2520:doi 2489:doi 2414:doi 2353:doi 2318:doi 2279:doi 2214:doi 2175:doi 2085:doi 1963:doi 1311:log 1273:sin 1215:log 1184:sin 1147:). 934:or 780:+ ( 734:or 732:→ 0 668:log 557:). 368:As 159:or 143:In 4483:: 2948:/ 2536:. 2526:. 2495:. 2487:. 2479:. 2408:. 2402:. 2359:, 2347:, 2324:. 2312:. 2308:. 2285:. 2273:. 2269:. 2222:. 2208:. 2204:. 2181:. 2171:40 2169:. 2165:. 2147:. 2126:. 2091:. 2057:. 2015:. 1969:. 1959:44 1953:. 1928:. 1893:. 1891:14 1826:. 1540:, 1536:, 1532:, 1528:, 1466:. 1359:. 1130:1. 893:, 883:, 866:, 856:, 844:+ 830:+ 826:+ 815:, 811:, 796:+ 784:+ 769:, 765:, 754:+ 750:+ 501:+ 303:, 299:, 295:, 288:. 239:, 235:, 151:, 3886:e 3879:t 3872:v 2886:. 2866:e 2859:t 2852:v 2731:( 2572:e 2565:t 2558:v 2544:. 2522:: 2505:. 2491:: 2483:: 2466:. 2447:. 2420:. 2416:: 2410:1 2355:: 2332:. 2320:: 2314:9 2293:. 2281:: 2275:1 2255:. 2230:. 2216:: 2210:3 2189:. 2177:: 2134:. 2101:. 2087:: 1977:. 1965:: 1938:. 1903:. 1870:. 1834:. 1796:. 1716:) 1645:. 1438:. 1433:2 1429:y 1425:+ 1422:y 1419:x 1416:2 1413:+ 1408:2 1404:x 1400:= 1395:2 1391:) 1387:y 1384:+ 1381:x 1378:( 1336:) 1333:5 1325:2 1321:z 1317:( 1291:) 1288:y 1285:+ 1282:x 1279:( 1248:3 1244:) 1240:) 1237:5 1229:2 1225:z 1221:( 1212:+ 1207:2 1203:) 1199:y 1196:+ 1193:x 1190:( 1181:( 1122:5 1118:x 1111:) 1108:1 1105:+ 1102:x 1099:+ 1094:2 1090:x 1086:+ 1081:3 1077:x 1073:+ 1068:4 1064:x 1060:( 1057:) 1054:1 1048:x 1045:( 1025:1 1022:+ 1019:x 1016:4 1013:+ 1008:2 1004:x 1000:6 997:+ 992:3 988:x 984:4 981:+ 976:4 972:x 963:4 959:) 955:1 952:+ 949:x 946:( 900:F 898:⋅ 896:E 890:F 886:E 880:E 873:F 871:/ 869:E 863:F 859:E 853:E 846:c 842:b 838:a 832:c 828:b 824:a 819:) 817:c 813:b 809:a 802:c 798:b 794:a 792:( 788:) 786:c 782:b 778:a 773:) 771:c 767:b 763:a 756:c 752:b 748:a 730:E 726:E 701:. 697:) 691:a 688:0 680:x 677:+ 674:a 662:1 658:( 649:x 645:a 641:+ 638:0 630:1 624:x 620:a 613:x 588:x 584:a 572:x 531:b 525:a 515:b 509:a 503:b 499:a 124:x 120:x 116:x 109:/ 105:x 97:x 95:( 93:f 71:) 65:( 60:) 56:( 50:. 20:)

Index

Syntactic equality
lead section
Learn how and when to remove this message

Symbolic integration
algebraic function
Axiom
mathematics
computer science
algorithms
software
mathematical expressions
mathematical objects
scientific computing
numerical computation
floating point numbers
variables
Software
computer algebra systems
programming language
user interface
routines
differentiation
chain rule
polynomial factorization
indefinite integration
public key cryptography
non-linear
formulas
formal methods

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.