Find link

language:

Find link is a tool written by Edward Betts.

searching for Journal of Symbolic Computation 93 found (136 total)

alternate case: journal of Symbolic Computation

Polyhedral complex (318 words) [view diff] exact match in snippet view article find links to article

Teo; Robbiano, Lorenzo (1988). "The Gröbner fan of an ideal". Journal of Symbolic Computation. 6 (2–3): 183–208. doi:10.1016/S0747-7171(88)80042-7. Bayer

Joris van der Hoeven (649 words) [view diff] exact match in snippet view article find links to article

of Holonomic Functions Near and in Regular Singularities". Journal of Symbolic Computation. 31 (6): 717–743. doi:10.1006/jsco.2000.0474. 2001 van der

Triangular decomposition (1,610 words) [view diff] exact match in snippet view article find links to article

Journal of Symbolic Computation, 28(1–2):105–124, 1999. D. Wang. Computing Triangular Systems and Regular Systems. Journal of Symbolic Computation 30(2)

FGLM algorithm (382 words) [view diff] exact match in snippet view article find links to article

of Zero-dimensional Gröbner Bases by Change of Ordering". Journal of Symbolic Computation. 16 (4): 329–344. doi:10.1006/jsco.1993.1051. Middeke, Johannes

James Renegar (1,009 words) [view diff] exact match in snippet view article find links to article

decision problem for the existential theory of the reals". Journal of Symbolic Computation. 13 (3): 255–299. doi:10.1016/S0747-7171(10)80003-3. (over

Wang Dongming (academic) (715 words) [view diff] exact match in snippet view article

Dongming (1993). "An elimination method for polynomial systems". Journal of Symbolic Computation. 16 (2): 83–114. doi:10.1006/jsco.1993.1035. Aubry, Philippe;

Gröbner fan (265 words) [view diff] exact match in snippet view article find links to article

Teo; Robbiano, Lorenzo (1988). "The Gröbner fan of an ideal". Journal of Symbolic Computation. 6 (2–3): 183–208. doi:10.1016/S0747-7171(88)80042-7. Bayer

Regular chain (1,415 words) [view diff] exact match in snippet view article find links to article

Lazard, M. Moreno Maza. On the theories of triangular sets. Journal of Symbolic Computation, 28(1–2):105–124, 1999. F. Boulier and F. Lemaire and M. Moreno

List of hypergeometric identities (102 words) [view diff] exact match in snippet view article find links to article

(1995), "Algorithms for m-fold hypergeometric summation", Journal of Symbolic Computation, 20 (4): 399–417, doi:10.1006/jsco.1995.1056, ISSN 0747-7171

Invariant of a binary form (2,706 words) [view diff] exact match in snippet view article find links to article

Popoviciu, Mihaela (2010a), "The invariants of the binary nonic", Journal of Symbolic Computation, 45 (6): 709–720, arXiv:1002.0761, doi:10.1016/j.jsc.2010.03

Mark Giesbrecht (494 words) [view diff] exact match in snippet view article find links to article

"Factoring in Skew-polynomial Rings over Finite Fields". Journal of Symbolic Computation. 26 (4): 463–486. doi:10.1006/jsco.1998.0224. Eberly, Wayne;

6-cube (623 words) [view diff] exact match in snippet view article find links to article

decomposition of three-dimensional space - ScienceDirect". Journal of Symbolic Computation. 5 (1): 141–161. doi:10.1016/S0747-7171(88)80010-5. Coxeter

Wu's method of characteristic set (1,462 words) [view diff] exact match in snippet view article find links to article

Journal of Symbolic Computation, 28(1–2):105–124 Hubert, E. Factorisation Free Decomposition Algorithms in Differential Algebra. Journal of Symbolic Computation

Vertex-transitive graph (646 words) [view diff] exact match in snippet view article find links to article

"Cubic vertex-transitive graphs on up to 1280 vertices", Journal of Symbolic Computation, 50: 465–477, arXiv:1201.5317, doi:10.1016/j.jsc.2012.09.002

Semi-symmetric graph (488 words) [view diff] exact match in snippet view article find links to article

semisymmetric graphs on 112 vertices via association schemes" (PDF), Journal of Symbolic Computation, 47 (10): 1175–1191, doi:10.1016/j.jsc.2011.12.040, MR 2926121

Associator (488 words) [view diff] exact match in snippet view article find links to article

"Identities for the Associator in Alternative Algebras". Journal of Symbolic Computation. 33 (3): 255–273. CiteSeerX 10.1.1.85.1905. doi:10.1006/jsco

Additive inverse (902 words) [view diff] exact match in snippet view article find links to article

Tobias (1989-03-01). "Boolean unification — The story so far". Journal of Symbolic Computation. Unification: Part 1. 7 (3): 275–293. doi:10.1016/S0747-7171(89)80013-6

Elementary number (136 words) [view diff] exact match in snippet view article find links to article

S2CID 3256250. Richardson, Daniel (1997). "How to recognize zero". Journal of Symbolic Computation. 24 (6): 627–645. doi:10.1006/jsco.1997.0157. v t e

Computational complexity of matrix multiplication (4,286 words) [view diff] exact match in snippet view article find links to article

1990). "Matrix multiplication via arithmetic progressions". Journal of Symbolic Computation. 9 (3): 251–280. doi:10.1016/S0747-7171(08)80013-2. Stothers

Joe P. Buhler (329 words) [view diff] exact match in snippet view article find links to article

Irregular primes and cyclotomic invariants to 12 million, Journal of Symbolic Computation, Vol. 31, 2001, pp. 89–96 doi:10.1006/jsco.1999.1011 Buhler

SMP (computer algebra system) (593 words) [view diff] exact match in snippet view article

p. 61, footnote Joel Moses, "Macsyma: A personal history", Journal of Symbolic Computation 47:123-130 (February 2012) doi:10.1016/j.jsc.2010.08.018, p

Valérie Berthé (608 words) [view diff] exact match in snippet view article find links to article

algorithm in high dimensions is almost always subtractive". Journal of Symbolic Computation. 85: 72–107. doi:10.1016/j.jsc.2017.07.004. Bureau, Société

Jacobi symbol (2,390 words) [view diff] exact match in snippet view article find links to article

Case of Three Algorithms for Computing the Jacobi Symbol". Journal of Symbolic Computation. 10 (6): 593–61. doi:10.1016/S0747-7171(08)80160-5. Computer

Zero-symmetric graph (543 words) [view diff] exact match in snippet view article find links to article

"Cubic vertex-transitive graphs on up to 1280 vertices", Journal of Symbolic Computation, 50: 465–477, arXiv:1201.5317, doi:10.1016/j.jsc.2012.09.002

Polyhedral terrain (224 words) [view diff] exact match in snippet view article find links to article

Micha (1989). "Visibility problems for polyhedral terrains". Journal of Symbolic Computation. 7 (1): 11–30. doi:10.1016/S0747-7171(89)80003-3. Sack, Jörg-Rüdiger;

System of polynomial equations (4,592 words) [view diff] exact match in snippet view article find links to article

of Zero-Dimensional Gröbner Basis by Change of Ordering". Journal of Symbolic Computation. 16 (4): 329–344. doi:10.1006/jsco.1993.1051. Lazard, D. (1992)

Strong pseudoprime (1,336 words) [view diff] exact match in snippet view article find links to article

Carmichael Numbers Which Are Strong Pseudoprimes to Several Bases". Journal of Symbolic Computation. 20 (2): 151–161. doi:10.1006/jsco.1995.1042. Zhenxiang Zhang;

Robert Arnott Wilson (667 words) [view diff] exact match in snippet view article find links to article

matrix representations of finite groups over finite fields". Journal of Symbolic Computation. 9 (5–6): 583–590. doi:10.1016/S0747-7171(08)80075-2. with

Geometric constraint solving (1,290 words) [view diff] exact match in snippet view article find links to article

Constraint Systems, Part I: Performance Measures for CAD". Journal of Symbolic Computation. 31 (4): 367–408. doi:10.1006/jsco.2000.0402. Christoph M.Hoffman;

Hans Zantema (342 words) [view diff] exact match in snippet view article find links to article

"Termination of term rewriting: interpretation and type elimination." Journal of Symbolic Computation 17.1 (1994): 23–50. Zantema, Hans. "Termination of term rewriting

Simon P. Norton (755 words) [view diff] exact match in snippet view article find links to article

ISBN 9780521575874. Norton, Simon (2001). "Computing in the Monster". Journal of Symbolic Computation. 31 (1–2): 193–201. doi:10.1006/jsco.1999.1008. Norton, Simon

Ore algebra (236 words) [view diff] exact match in snippet view article find links to article

Elimination in Ore Algebras Proves Multivariate Identities" (PDF). Journal of Symbolic Computation. 26 (2). Elsevier: 187–227. doi:10.1006/jsco.1998.0207. v t

A Treatise on the Binomial Theorem (629 words) [view diff] exact match in snippet view article find links to article

failed and a challenge to those who have not yet failed". Journal of Symbolic Computation. 18 (6): 497–501. doi:10.1006/jsco.1994.1061. S2CID 15642571

Cylindrical algebraic decomposition (430 words) [view diff] exact match in snippet view article find links to article

; Heintz, Joos: Real quantifier elimination is doubly exponential, Journal of Symbolic Computation, 1988. Volume 5, Issues 1–2, ISSN 0747-7171, v t e

Kummer–Vandiver conjecture (981 words) [view diff] exact match in snippet view article find links to article

at Marquette University, Milwaukee, WI, May 12–16, 1996), Journal of Symbolic Computation, 31 (1): 89–96, doi:10.1006/jsco.1999.1011, ISSN 0747-7171

Block Wiedemann algorithm (1,084 words) [view diff] exact match in snippet view article find links to article

analysis of block Wiedemann for leading invariant factors". Journal of Symbolic Computation. 108: 98–116. arXiv:1803.03864. doi:10.1016/j.jsc.2021.06.005

Picard–Vessiot theory (918 words) [view diff] exact match in snippet view article find links to article

solving second order linear homogeneous differential equations", Journal of Symbolic Computation, 2 (1): 3–43, doi:10.1016/S0747-7171(86)80010-4, ISSN 0747-7171

Victor Pan (759 words) [view diff] exact match in snippet view article find links to article

optimal algorithms for numerical factorization and root-finding", Journal of Symbolic Computation, 33 (5): 701–733, doi:10.1006/jsco.2002.0531, MR 1919911

Thierry Coquand (517 words) [view diff] exact match in snippet view article find links to article

Mathematics, Intuitionistic Type Theory and Higher Order Deduction". Journal of Symbolic Computation. 1 (3): 323–328. doi:10.1016/S0747-7171(85)80040-7. Archived

Graph canonization (1,112 words) [view diff] exact match in snippet view article find links to article

153–182, MR 0344150. McKay, Brendan D.; Piperno, Adolfo (2014), "Journal of Symbolic Computation", Practical graph isomorphism, II, vol. 60, pp. 94–112, arXiv:1301

Hypergeometric function (6,920 words) [view diff] exact match in snippet view article find links to article

(1995). "Algorithms for m-fold hypergeometric summation". Journal of Symbolic Computation. 20 (4): 399–417. doi:10.1006/jsco.1995.1056. ISSN 0747-7171

Notebook interface (1,119 words) [view diff] exact match in snippet view article find links to article

"A Survey of User Interfaces for Computer Algebra Systems", Journal of Symbolic Computation 25:2:127-159 (February 1998), doi:10.1006/jsco.1997.0170 The

Tensor decomposition (760 words) [view diff] exact match in snippet view article find links to article

"General tensor decomposition, moment matrices and applications". Journal of Symbolic Computation. 52: 51–71. arXiv:1105.1229. doi:10.1016/j.jsc.2012.05.012

Binary GCD algorithm (1,993 words) [view diff] exact match in snippet view article find links to article

Computation in Z[i] as an Analogue to the Binary GCD Algorithm". Journal of Symbolic Computation. 30 (5): 605–617. doi:10.1006/jsco.2000.0422. Damgård, Ivan

Structural synthesis of programs (832 words) [view diff] exact match in snippet view article find links to article

Mints, G.; Tyugu, E. (1988). The programming system PRIZ. Journal of Symbolic Computation, 5(3), 359 - 375. "About Cocovila". Archived from the original

Numerical algebraic geometry (1,306 words) [view diff] exact match in snippet view article find links to article

J. (March 2017). "What is numerical algebraic geometry?". Journal of Symbolic Computation. 79: 499–507. doi:10.1016/j.jsc.2016.07.015. Sommese, Andrew

Petkovšek's algorithm (1,431 words) [view diff] exact match in snippet view article find links to article

solutions of linear recurrences with polynomial coefficients". Journal of Symbolic Computation. 14 (2–3): 243–264. doi:10.1016/0747-7171(92)90038-6. ISSN 0747-7171

Nonlinear system (2,645 words) [view diff] exact match in snippet view article find links to article

(2009). "Thirty years of Polynomial System Solving, and now?". Journal of Symbolic Computation. 44 (3): 222–231. doi:10.1016/j.jsc.2008.03.004. Billings S

Pattern matching (2,581 words) [view diff] exact match in snippet view article find links to article

library based on SNOBOL/SPITBOL Temur Kutsia. Flat Matching. Journal of Symbolic Computation 43(12): 858–873. Describes in details flat matching in Mathematica

Language equation (1,127 words) [view diff] exact match in snippet view article find links to article

(2001). "Unification of Concept Terms in Description Logics". Journal of Symbolic Computation. 31 (3): 277–305. doi:10.1006/jsco.2000.0426. ISSN 0747-7171

15 puzzle (2,072 words) [view diff] exact match in snippet view article find links to article

(1990). "The (n2−1)-puzzle and related relocation problems". Journal of Symbolic Computation. 10 (2): 111–137. doi:10.1016/S0747-7171(08)80001-6. Richard

Zassenhaus algorithm (1,400 words) [view diff] exact match in snippet view article find links to article

1997), "Some algorithms for nilpotent permutation groups", Journal of Symbolic Computation, 23 (4): 335–354, doi:10.1006/jsco.1996.0092. Fischer, Gerd

Real closed field (2,984 words) [view diff] exact match in snippet view article find links to article

decision problem for the existential theory of the reals". Journal of Symbolic Computation. 13 (3): 255–299. doi:10.1016/S0747-7171(10)80003-3. Passmore

Charles Riquier (407 words) [view diff] exact match in snippet view article find links to article

analytic initial conditions with a non-analytic solution". Journal of Symbolic Computation. 35 (5): 487–498. doi:10.1016/S0747-7171(03)00017-8. Kasner

Sporadic group (2,079 words) [view diff] exact match in snippet view article find links to article

(2001). "Matrix generators for exceptional groups of Lie type". Journal of Symbolic Computation. 31 (4): 429–445. doi:10.1006/jsco.2000.0431. MR 1823074. S2CID 14682147

Polynomial solutions of P-recursive equations (1,282 words) [view diff] exact match in snippet view article find links to article

solutions of linear recurrences with polynomial coefficients". Journal of Symbolic Computation. 14 (2–3): 243–264. doi:10.1016/0747-7171(92)90038-6. ISSN 0747-7171

Carmichael number (3,602 words) [view diff] exact match in snippet view article find links to article

Carmichael Numbers Which Are Strong Pseudoprimes to Several Bases". Journal of Symbolic Computation. 20 (2): 151–161. doi:10.1006/jsco.1995.1042. Pinch, Richard

Ham sandwich theorem (2,708 words) [view diff] exact match in snippet view article find links to article

(1986), "Computing a ham sandwich cut in two dimensions", Journal of Symbolic Computation, 2 (2): 171–178, doi:10.1016/S0747-7171(86)80020-7. Lo, Chi-Yuan;

Regular prime (3,272 words) [view diff] exact match in snippet view article find links to article

"Irregular Primes and Cyclotomic Invariants to 12 Million", Journal of Symbolic Computation, 31 (1–2): 89–96, doi:10.1006/jsco.1999.1011 Richard K. Guy

Guillotine partition (1,283 words) [view diff] exact match in snippet view article find links to article

"Improved bounds for rectangular and guillotine partitions". Journal of Symbolic Computation. 7 (6): 591–610. doi:10.1016/S0747-7171(89)80042-2. ISSN 0747-7171

Differential algebra (7,852 words) [view diff] exact match in snippet view article find links to article

set method for differential–difference polynomial systems". Journal of Symbolic Computation. 44 (9): 1137–1163. doi:10.1016/j.jsc.2008.02.010. Golubitsky

Quantum Fourier transform (3,302 words) [view diff] exact match in snippet view article find links to article

Fourier transform over symmetric groups — improved result". Journal of Symbolic Computation. 75: 219–243. doi:10.1016/j.jsc.2015.11.016. Beals, Robert

Moving frames method (414 words) [view diff] exact match in snippet view article find links to article

Kogan, I.A. (2001). "Inductive construction of moving frames". Journal of Symbolic Computation. 285: 157–170. doi:10.1016/S0747-7171(03)00092-0. Olver, Peter

Gaussian integral (4,365 words) [view diff] exact match in snippet view article find links to article

Finite Terms with Special Functions: the Error Function". Journal of Symbolic Computation. 1 (3): 283–302. doi:10.1016/S0747-7171(85)80037-7. Lee, Peter

Larch Prover (1,558 words) [view diff] exact match in snippet view article find links to article

Lai, "Some experiments with a completion theorem prover", Journal of Symbolic Computation 13:1, 1992, pages 81–100, ISSN 0747-7171. Ursula Martin and

Conway group (2,300 words) [view diff] exact match in snippet view article find links to article

Curtis and B. T. Fairburn (2009), "Symmetric Representation of the elements of the Conway Group .0", Journal of Symbolic Computation, 44: 1044–1067.

Baillie–PSW primality test (2,526 words) [view diff] exact match in snippet view article find links to article

Carmichael Numbers Which Are Strong Pseudoprimes to Several Bases". Journal of Symbolic Computation. 20 (2): 151–161. doi:10.1006/jsco.1995.1042. isprime - Maple

List of Chinese discoveries (5,362 words) [view diff] exact match in snippet view article find links to article

M. Moreno Maza (1999). On the theories of triangular sets. Journal of Symbolic Computation, 28(1–2):105–124 Exum, Roy (December 27, 2015). "Roy Exum:

Tropical geometry (3,660 words) [view diff] exact match in snippet view article find links to article

Bernd; Thomas, Rekha (2005). "Computing Tropical Varieties". Journal of Symbolic Computation. 42 (1–2): 54–73. arXiv:math/0507563. Bibcode:2005math....

P-recursive equation (2,216 words) [view diff] exact match in snippet view article find links to article

solutions of linear recurrences with polynomial coefficients". Journal of Symbolic Computation. 14 (2–3): 243–264. doi:10.1016/0747-7171(92)90038-6. ISSN 0747-7171

Indefinite sum (2,767 words) [view diff] exact match in snippet view article find links to article

(1993), "On computing closed forms for indefinite summations", Journal of Symbolic Computation, 16 (4): 355–376, doi:10.1006/jsco.1993.1053, MR 1263873 Goldberg

Polygon partition (2,579 words) [view diff] exact match in snippet view article find links to article

"Improved bounds for rectangular and guillotine partitions". Journal of Symbolic Computation. 7 (6): 591–610. doi:10.1016/S0747-7171(89)80042-2. ISSN 0747-7171

Nth root (4,773 words) [view diff] exact match in snippet view article find links to article

(1985). "Simplification of Expressions Involving Radicals". Journal of Symbolic Computation. 1 (189–210): 189–210. doi:10.1016/S0747-7171(85)80014-6. Wantzel

Matrix multiplication algorithm (4,483 words) [view diff] exact match in snippet view article find links to article

"Matrix multiplication via arithmetic progressions" (PDF), Journal of Symbolic Computation, 9 (3): 251, doi:10.1016/S0747-7171(08)80013-2 Iliopoulos,

Miller–Rabin primality test (5,639 words) [view diff] exact match in snippet view article find links to article

Carmichael Numbers Which Are Strong Pseudoprimes to Several Bases". Journal of Symbolic Computation. 20 (2): 151–161. doi:10.1006/jsco.1995.1042. Cormen, Thomas

Wolfgang Bibel (2,638 words) [view diff] exact match in snippet view article find links to article

(2003). "leanCoP: lean connection-based theorem proving". Journal of Symbolic Computation. 36 (1–2). Elsevier BV: 139–161. doi:10.1016/s0747-7171(03)00037-3

Janet basis (2,269 words) [view diff] exact match in snippet view article find links to article

Basis Method for Modules over Rings of Differential Operators, Journal of Symbolic Computation 18, pages 223–248, 1994. W. Adams, P. Loustaunau, An introduction

Quartic function (6,853 words) [view diff] exact match in snippet view article find links to article

elimination: Optimal solution for two classical examples". Journal of Symbolic Computation. 5 (1–2): 261–266. doi:10.1016/S0747-7171(88)80015-4. Descartes

Hopf bifurcation (4,903 words) [view diff] exact match in snippet view article find links to article

quantifier elimination in a software component architecture". Journal of Symbolic Computation. 30 (2): 161–179. doi:10.1006/jsco.1999.0353. 18.385J / 2.036J

Massachusetts Institute of Technology (20,052 words) [view diff] exact match in snippet view article find links to article

See also Joel Moses (2012), "Macsyma: A personal history", Journal of Symbolic Computation, 47 (2): 123–130, doi:10.1016/j.jsc.2010.08.018 "Tübinger Internet

Lie point symmetry (2,893 words) [view diff] exact match in snippet view article find links to article

"Isogroups of differential equations using algebraic computing". Journal of Symbolic Computation. 14 (1): 103–120. doi:10.1016/0747-7171(92)90029-4. hdl:10536/DRO/DU:30126539

Quasi-polynomial growth (727 words) [view diff] exact match in snippet view article find links to article

"Feasible arithmetic computations: Valiant's hypothesis", Journal of Symbolic Computation, 4 (2): 137–172, doi:10.1016/S0747-7171(87)80063-9, MR 0922386

Dale Miller (academic) (1,356 words) [view diff] case mismatch in snippet view article

497–536. Miller, D. (1992). Unification under a mixed prefix. Journal of symbolic computation, 14(4), 321–358. Hodas, J. S., & Miller, D. (1994). Logic programming

Euclidean algorithm (15,349 words) [view diff] exact match in snippet view article find links to article

"On the Asymptotic Analysis of the Euclidean Algorithm". Journal of Symbolic Computation. 10 (1): 53–58. doi:10.1016/S0747-7171(08)80036-3. Knuth 1997

Bernoulli number (13,044 words) [view diff] exact match in snippet view article find links to article

"Irregular Primes and Cyclotomic Invariants to 12 Million", Journal of Symbolic Computation, 31 (1–2): 89–96, doi:10.1006/jsco.1999.1011 Harvey, David

Geometrical properties of polynomial roots (5,332 words) [view diff] exact match in snippet view article find links to article

George E. (2001). "Polynomial minimum root separation" (PDF). Journal of Symbolic Computation. 32 (5): 467–473. doi:10.1006/jsco.2001.0481. Kac, M. (1943)

Unification (computer science) (7,377 words) [view diff] exact match in snippet view article

(1989). "Unification of Boolean Rings and Abelian Groups". Journal of Symbolic Computation. 8 (5): 449–477. doi:10.1016/s0747-7171(89)80054-9. Baader

Tensor rank decomposition (6,308 words) [view diff] exact match in snippet view article find links to article

"General tensor decomposition, moment matrices and applications". Journal of Symbolic Computation. 52: 51–71. arXiv:1105.1229. doi:10.1016/j.jsc.2012.05.012

Real-root isolation (4,602 words) [view diff] exact match in snippet view article find links to article

Mehlhorn, K. (2016). "Computing real roots of real polynomials". Journal of Symbolic Computation. 73: 46–86. arXiv:1308.4088. doi:10.1016/j.jsc.2015.03.004

List of problems in loop theory and quasigroup theory (3,589 words) [view diff] exact match in snippet view article find links to article

Vojtěchovský, Petr (2007), "Moufang loops of order 64 and 81", Journal of Symbolic Computation, 42 (9), to appear: 871–883, doi:10.1016/j.jsc.2007.06.004

Topological data analysis (10,980 words) [view diff] exact match in snippet view article find links to article

persistence landscapes toolbox for topological statistics". Journal of Symbolic Computation. 78: 91–114. arXiv:1501.00179. Bibcode:2015arXiv150100179B

Landau-Mignotte bound (2,583 words) [view diff] exact match in snippet view article find links to article

JSTOR 44165422. Abbott, John (2013). "Bounds on factors in Z[x]". Journal of Symbolic Computation. 50: 532–563. arXiv:0904.3057. doi:10.1016/j.jsc.2012.09.004

Persistence module (2,966 words) [view diff] exact match in snippet view article find links to article

complexes in multidimensional persistent homology theory". Journal of Symbolic Computation. Algorithms and Software for Computational Topology. 78: 61–75