Challenges of Symbolic Computation: My Favorite Open Problems

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of symbolic computation Ročník 29; číslo 6; s. 891 - 919
Hlavní autor: Kaltofen, Erich
Médium: Journal Article
Jazyk:angličtina
Vydáno: 01.06.2000
ISSN:0747-7171
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Author Kaltofen, Erich
Author_xml – sequence: 1
  givenname: Erich
  surname: Kaltofen
  fullname: Kaltofen, Erich
BookMark eNp1j8FKxDAURbMYwZnRrev8QOtL0_a1ggspjgojI6jrkqYv2iFthqQK_XunjCvB1V1czuWeFVsMbiDGrgTEAiC_3gft4gQAYpAIC7YETDFCgeKcrULYH5syldmS3VafyloaPihwZ_jr1DfOdppXrj98jWrs3HDDnye-Ud_OdyPx3YEG_uJdY6kPF-zMKBvo8jfX7H1z_1Y9Rtvdw1N1t410InGMGoQsFbnB1mBDqpRtYlDqLCNRmMJQolqSZZ41MhFFq4sCMQXMWzCyKQsq5Zqlp13tXQieTK2707nRq87WAupZu56161m7nrWPWPwHO_iuV376D_gBwXte1g
CitedBy_id crossref_primary_10_1007_s00170_011_3433_0
crossref_primary_10_1145_1838599_1838624
crossref_primary_10_1007_s00037_013_0063_y
crossref_primary_10_1016_j_jsc_2012_05_008
crossref_primary_10_1016_j_tcs_2004_09_002
crossref_primary_10_1016_j_tcs_2010_11_047
crossref_primary_10_1016_j_jsc_2024_102367
crossref_primary_10_1016_j_jsc_2005_07_001
crossref_primary_10_1145_3313880_3313894
crossref_primary_10_1016_j_tcs_2004_01_011
crossref_primary_10_1145_3638349
crossref_primary_10_1016_S0024_3795_01_00472_4
crossref_primary_10_1080_00207160_2012_716199
crossref_primary_10_1016_j_jsc_2007_11_005
crossref_primary_10_1016_j_jsc_2010_08_012
crossref_primary_10_1016_j_jsc_2011_12_008
crossref_primary_10_1137_S0097539704443793
crossref_primary_10_1007_s10208_015_9289_1
crossref_primary_10_1137_15M1018265
crossref_primary_10_1145_2576802_2576829
Cites_doi 10.1006/jsco.1998.0233
10.1016/S0378-4754(96)00027-4
10.1016/0196-6774(88)90026-0
10.1145/321662.321664
10.1016/0885-064X(85)90024-X
10.1137/0216040
10.1006/jsco.1998.0216
10.1137/0218059
10.1145/174603.174409
10.1016/S0747-7171(08)80015-6
10.1016/0196-6774(80)90013-9
10.1090/S0025-5718-98-00944-2
10.1145/1086837.1086839
10.1090/S0025-5718-1970-0276200-X
10.1145/309831
10.1145/355705.355709
10.1007/BF01844169
10.1145/74540.74556
10.2307/2690852
10.1145/190347.190356
10.1145/235699.235705
10.1145/800205.806338
10.1007/BF01272074
10.1090/S0025-5718-98-00973-9
10.1007/BF02288367
10.1006/jsco.1994.1025
10.1109/TIT.1969.1054260
10.1006/jsco.1995.1055
10.1145/258533.258604
10.1007/BF02579403
10.1016/S0747-7171(08)80012-0
10.1016/0304-3975(81)90064-5
10.1016/S0022-4049(97)00013-3
10.1109/TIT.1986.1057137
10.1145/190347.190424
10.1145/321879.321890
10.1145/367487.367501
10.1090/S0002-9947-1969-0237477-8
10.1109/9.35816
10.1145/321662.321665
10.1145/164081.164088
10.1006/jcss.1995.1023
10.1006/jsco.1997.0152
10.1007/BF01457454
10.1007/BF01213466
10.4153/CMB-1966-083-2
10.1080/10556789208805505
10.1145/32439.32444
10.1090/S0025-5718-97-00856-9
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1006/jsco.2000.0370
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 919
ExternalDocumentID 10_1006_jsco_2000_0370
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9DU
9JN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
AAYXX
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABWVN
ABXDB
ACDAQ
ACGFS
ACLOT
ACNNM
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADFGL
ADMUD
ADNMO
ADVLN
AEBSH
AEIPS
AEKER
AENEX
AEUPX
AEXQZ
AFJKZ
AFPUW
AFTJW
AGHFR
AGQPQ
AGUBO
AGYEJ
AHHHB
AIALX
AIEXJ
AIGII
AIGVJ
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
APXCP
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
CITATION
COF
CS3
DM4
DU5
EBS
EFBJH
EFKBS
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG5
M25
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
UPT
WUQ
XPP
YQT
ZMT
ZU3
~G-
~HD
ID FETCH-LOGICAL-c237t-b705416f7df7bea93d2f73c55e18f8fe2ade3965b3218dc88774076d0f3b98e93
ISICitedReferencesCount 40
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000087972800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0747-7171
IngestDate Sat Nov 29 02:50:54 EST 2025
Tue Nov 18 21:45:05 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c237t-b705416f7df7bea93d2f73c55e18f8fe2ade3965b3218dc88774076d0f3b98e93
PageCount 29
ParticipantIDs crossref_citationtrail_10_1006_jsco_2000_0370
crossref_primary_10_1006_jsco_2000_0370
PublicationCentury 2000
PublicationDate 2000-06-00
PublicationDateYYYYMMDD 2000-06-01
PublicationDate_xml – month: 06
  year: 2000
  text: 2000-06-00
PublicationDecade 2000
PublicationTitle Journal of symbolic computation
PublicationYear 2000
References 10.1006/jsco.2000.0370_RF50
10.1006/jsco.2000.0370_RF51
10.1006/jsco.2000.0370_RF52
Jeffrey (10.1006/jsco.2000.0370_RF65) 1997; 24
Boppana (10.1006/jsco.2000.0370_RF13) 1989
10.1006/jsco.2000.0370_RF55
Carathéodory (10.1006/jsco.2000.0370_RF25) 1964
10.1006/jsco.2000.0370_RF57
10.1006/jsco.2000.0370_RF58
Bürgisser (10.1006/jsco.2000.0370_RF22) 1997
10.1006/jsco.2000.0370_RF59
Massey (10.1006/jsco.2000.0370_RF93) 1969
Brown (10.1006/jsco.2000.0370_RF17) 1971; 18
10.1006/jsco.2000.0370_RF60
10.1006/jsco.2000.0370_RF5
10.1006/jsco.2000.0370_RF61
10.1006/jsco.2000.0370_RF62
10.1006/jsco.2000.0370_RF7
10.1006/jsco.2000.0370_RF63
10.1006/jsco.2000.0370_RF109
10.1006/jsco.2000.0370_RF108
Shirayanagi (10.1006/jsco.2000.0370_RF105) 1996; 42
Kaltofen (10.1006/jsco.2000.0370_RF70) 1992
Becker (10.1006/jsco.2000.0370_RF9) 1993
Shoup (10.1006/jsco.2000.0370_RF107) 1995; 20
Collins (10.1006/jsco.2000.0370_RF27) 1960; 3
10.1006/jsco.2000.0370_RF1
Bailey (10.1006/jsco.2000.0370_RF8) 1997; 66
10.1006/jsco.2000.0370_RF3
10.1006/jsco.2000.0370_RF101
10.1006/jsco.2000.0370_RF100
Poljak (10.1006/jsco.2000.0370_RF102) 1993; 6
Kaminski (10.1006/jsco.2000.0370_RF77) 1988; 9
10.1006/jsco.2000.0370_RF31
10.1006/jsco.2000.0370_RF32
Emiris (10.1006/jsco.2000.0370_RF37) 1997; 117 & 118
10.1006/jsco.2000.0370_RF33
10.1006/jsco.2000.0370_RF34
10.1006/jsco.2000.0370_RF35
Musser (10.1006/jsco.2000.0370_RF97) 1975; 22
Wiedemann (10.1006/jsco.2000.0370_RF119) 1986
Zhi (10.1006/jsco.2000.0370_RF120) 1998; 26
10.1006/jsco.2000.0370_RF38
Canny (10.1006/jsco.2000.0370_RF23) 1990; 9
10.1006/jsco.2000.0370_RF39
Berlekamp (10.1006/jsco.2000.0370_RF10) 1970; 24
Lazard (10.1006/jsco.2000.0370_RF85) 1981; 15
Risch (10.1006/jsco.2000.0370_RF103) 1969; 139
Buchberger (10.1006/jsco.2000.0370_RF20) 1970; 4
Griewank (10.1006/jsco.2000.0370_RF54) 1992; 1
Håstad (10.1006/jsco.2000.0370_RF56) 1989; 18
Jeffrey (10.1006/jsco.2000.0370_RF64) 1994; 67
Teitelbaum (10.1006/jsco.2000.0370_RF112) 1998; 67
Knuth (10.1006/jsco.2000.0370_RF79) 1997
10.1006/jsco.2000.0370_RF40
10.1006/jsco.2000.0370_RF41
von zur Gathen (10.1006/jsco.2000.0370_RF47) 1992; 2
Brown (10.1006/jsco.2000.0370_RF18) 1971; 18
10.1006/jsco.2000.0370_RF43
Schönhage (10.1006/jsco.2000.0370_RF104) 1985; 1
10.1006/jsco.2000.0370_RF44
von zur Gathen (10.1006/jsco.2000.0370_RF46) 1999
10.1006/jsco.2000.0370_RF48
Eckart (10.1006/jsco.2000.0370_RF36) 1936; 1
10.1006/jsco.2000.0370_RF49
Babai (10.1006/jsco.2000.0370_RF6) 1986; 6
Bronstein (10.1006/jsco.2000.0370_RF16) 1997
Lenstra (10.1006/jsco.2000.0370_RF87) 1987; 16
Cox (10.1006/jsco.2000.0370_RF30) 1996
Stoutemyer (10.1006/jsco.2000.0370_RF111) 1991; 38
Kaltofen (10.1006/jsco.2000.0370_RF75) 1998; 67
Macaulay (10.1006/jsco.2000.0370_RF92) 1916
10.1006/jsco.2000.0370_RF95
10.1006/jsco.2000.0370_RF96
10.1006/jsco.2000.0370_RF11
10.1006/jsco.2000.0370_RF99
Kaltofen (10.1006/jsco.2000.0370_RF76) 1990; 9
10.1006/jsco.2000.0370_RF14
10.1006/jsco.2000.0370_RF19
Caviness (10.1006/jsco.2000.0370_RF26) 1998
Lawden (10.1006/jsco.2000.0370_RF84) 1989
Kaltofen (10.1006/jsco.2000.0370_RF72) 1988
Jeffrey (10.1006/jsco.2000.0370_RF66) 1994; 20
Musser (10.1006/jsco.2000.0370_RF98) 1996
Antoniou (10.1006/jsco.2000.0370_RF4) 1979
10.1006/jsco.2000.0370_RF24
Golub (10.1006/jsco.2000.0370_RF53) 1996
10.1006/jsco.2000.0370_RF28
Kahan (10.1006/jsco.2000.0370_RF68) 1966; 9
Fiduccia (10.1006/jsco.2000.0370_RF42) 1972
Jenks (10.1006/jsco.2000.0370_RF67) 1992
10.1006/jsco.2000.0370_RF73
10.1006/jsco.2000.0370_RF117
Corless (10.1006/jsco.2000.0370_RF29) 1996; 30
10.1006/jsco.2000.0370_RF74
10.1006/jsco.2000.0370_RF116
10.1006/jsco.2000.0370_RF115
10.1006/jsco.2000.0370_RF78
Loos (10.1006/jsco.2000.0370_RF91) 1974; 8
Loos (10.1006/jsco.2000.0370_RF90) 1982
Weinberger (10.1006/jsco.2000.0370_RF118) 1976; 2
Brent (10.1006/jsco.2000.0370_RF15) 1980; 1
Bernstein (10.1006/jsco.2000.0370_RF12) 1998; 26
10.1006/jsco.2000.0370_RF110
10.1006/jsco.2000.0370_RF114
10.1006/jsco.2000.0370_RF80
10.1006/jsco.2000.0370_RF113
10.1006/jsco.2000.0370_RF81
10.1006/jsco.2000.0370_RF82
10.1006/jsco.2000.0370_RF83
10.1006/jsco.2000.0370_RF86
10.1006/jsco.2000.0370_RF89
Gantmacher (10.1006/jsco.2000.0370_RF45) 1960
Buchberger (10.1006/jsco.2000.0370_RF21) 1985
Kaltofen (10.1006/jsco.2000.0370_RF71) 1995; 50
Minnichelli (10.1006/jsco.2000.0370_RF94) 1989; 34
Kaliski (10.1006/jsco.2000.0370_RF69) 1997
Lenstra (10.1006/jsco.2000.0370_RF88) 1982; 261
Achiezer (10.1006/jsco.2000.0370_RF2) 1956
Shoup (10.1006/jsco.2000.0370_RF106) 1994; 17
References_xml – ident: 10.1006/jsco.2000.0370_RF78
– ident: 10.1006/jsco.2000.0370_RF115
– ident: 10.1006/jsco.2000.0370_RF55
– volume: 26
  start-page: 667
  year: 1998
  ident: 10.1006/jsco.2000.0370_RF120
  article-title: Nearest singular polynomial
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1998.0233
– volume: 42
  start-page: 509
  year: 1996
  ident: 10.1006/jsco.2000.0370_RF105
  article-title: Floating point Gröbner bases
  publication-title: Math. Comput. Simul.
  doi: 10.1016/S0378-4754(96)00027-4
– ident: 10.1006/jsco.2000.0370_RF32
– year: 1997
  ident: 10.1006/jsco.2000.0370_RF22
– ident: 10.1006/jsco.2000.0370_RF61
– year: 1998
  ident: 10.1006/jsco.2000.0370_RF26
– ident: 10.1006/jsco.2000.0370_RF109
– volume: 9
  start-page: 354
  year: 1988
  ident: 10.1006/jsco.2000.0370_RF77
  article-title: Addition requirements for matrix and transposed matrix products
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(88)90026-0
– volume: 18
  start-page: 478
  year: 1971
  ident: 10.1006/jsco.2000.0370_RF17
  article-title: On Euclid’s algorithm and the computation of polynomial greatest common divisors
  publication-title: J. ACM
  doi: 10.1145/321662.321664
– ident: 10.1006/jsco.2000.0370_RF49
– ident: 10.1006/jsco.2000.0370_RF41
– volume: 1
  start-page: 118
  year: 1985
  ident: 10.1006/jsco.2000.0370_RF104
  article-title: Quasi-GCD computations
  publication-title: J. Complexity
  doi: 10.1016/0885-064X(85)90024-X
– volume: 38
  start-page: 778
  year: 1991
  ident: 10.1006/jsco.2000.0370_RF111
  article-title: Crimes and misdemeanors in the computer algebra trade
  publication-title: Notices AMS
– year: 1996
  ident: 10.1006/jsco.2000.0370_RF30
– ident: 10.1006/jsco.2000.0370_RF5
– volume: 16
  start-page: 591
  year: 1987
  ident: 10.1006/jsco.2000.0370_RF87
  article-title: Factoring multivariate polynomials over algebraic number fields
  publication-title: SIAM J. Comput.
  doi: 10.1137/0216040
– volume: 26
  start-page: 339
  year: 1998
  ident: 10.1006/jsco.2000.0370_RF12
  article-title: Composing power series over a finite ring in essentially linear time
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1998.0216
– volume: 18
  start-page: 859
  year: 1989
  ident: 10.1006/jsco.2000.0370_RF56
  article-title: Polynomial time algorithms for finding integer relations among real numbers
  publication-title: SIAM J. Comput.
  doi: 10.1137/0218059
– year: 1997
  ident: 10.1006/jsco.2000.0370_RF69
– start-page: 173
  year: 1982
  ident: 10.1006/jsco.2000.0370_RF90
  article-title: Computing in algebraic extensions
– volume: 20
  start-page: 124
  year: 1994
  ident: 10.1006/jsco.2000.0370_RF66
  article-title: The evaluation of trigonometric integrals avoiding spurious discontinuities
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/174603.174409
– ident: 10.1006/jsco.2000.0370_RF81
– ident: 10.1006/jsco.2000.0370_RF101
– year: 1964
  ident: 10.1006/jsco.2000.0370_RF25
– start-page: 31
  year: 1972
  ident: 10.1006/jsco.2000.0370_RF42
  article-title: On obtaining upper bounds on the complexity of matrix multiplication
– ident: 10.1006/jsco.2000.0370_RF89
– ident: 10.1006/jsco.2000.0370_RF44
– volume: 9
  start-page: 301
  year: 1990
  ident: 10.1006/jsco.2000.0370_RF76
  article-title: Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
  publication-title: J. Symb. Comput.
  doi: 10.1016/S0747-7171(08)80015-6
– year: 1993
  ident: 10.1006/jsco.2000.0370_RF9
– volume: 1
  start-page: 259
  year: 1980
  ident: 10.1006/jsco.2000.0370_RF15
  article-title: Fast solution of Toeplitz systems of equations and computation of Padé approximants
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(80)90013-9
– ident: 10.1006/jsco.2000.0370_RF96
– ident: 10.1006/jsco.2000.0370_RF50
– volume: 67
  start-page: 1179
  year: 1998
  ident: 10.1006/jsco.2000.0370_RF75
  article-title: Subquadratic-time factoring of polynomials over finite fields
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-98-00944-2
– volume: 8
  start-page: 9
  year: 1974
  ident: 10.1006/jsco.2000.0370_RF91
  article-title: Toward a formal implementation of computer algebra
  publication-title: SIGSAM Bull.
  doi: 10.1145/1086837.1086839
– ident: 10.1006/jsco.2000.0370_RF58
– volume: 24
  start-page: 713
  year: 1970
  ident: 10.1006/jsco.2000.0370_RF10
  article-title: Factoring polynomials over large finite fields
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-1970-0276200-X
– ident: 10.1006/jsco.2000.0370_RF28
– ident: 10.1006/jsco.2000.0370_RF34
  doi: 10.1145/309831
– volume: 2
  start-page: 335
  year: 1976
  ident: 10.1006/jsco.2000.0370_RF118
  article-title: Factoring polynomials over algebraic number fields
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/355705.355709
– ident: 10.1006/jsco.2000.0370_RF11
– ident: 10.1006/jsco.2000.0370_RF82
– volume: 4
  start-page: 374
  year: 1970
  ident: 10.1006/jsco.2000.0370_RF20
  article-title: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
  publication-title: Aequationes Math.
  doi: 10.1007/BF01844169
– ident: 10.1006/jsco.2000.0370_RF19
– ident: 10.1006/jsco.2000.0370_RF24
  doi: 10.1145/74540.74556
– volume: 67
  start-page: 294
  year: 1994
  ident: 10.1006/jsco.2000.0370_RF64
  article-title: The importance of being continuous
  publication-title: Math. Mag.
  doi: 10.2307/2690852
– ident: 10.1006/jsco.2000.0370_RF110
– ident: 10.1006/jsco.2000.0370_RF95
– ident: 10.1006/jsco.2000.0370_RF117
  doi: 10.1145/190347.190356
– ident: 10.1006/jsco.2000.0370_RF31
– ident: 10.1006/jsco.2000.0370_RF116
– volume: 30
  start-page: 28
  year: 1996
  ident: 10.1006/jsco.2000.0370_RF29
  article-title: The unwinding number
  publication-title: SIGSAM Bull.
  doi: 10.1145/235699.235705
– ident: 10.1006/jsco.2000.0370_RF113
  doi: 10.1145/800205.806338
– volume: 2
  start-page: 187
  year: 1992
  ident: 10.1006/jsco.2000.0370_RF47
  article-title: Computing Frobenius maps and factoring polynomials
  publication-title: Comput. Complexity
  doi: 10.1007/BF01272074
– ident: 10.1006/jsco.2000.0370_RF62
– year: 1997
  ident: 10.1006/jsco.2000.0370_RF79
– volume: 67
  start-page: 1665
  year: 1998
  ident: 10.1006/jsco.2000.0370_RF112
  article-title: Euclid’s algorithm and the Lanczos method over finite fields
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-98-00973-9
– ident: 10.1006/jsco.2000.0370_RF14
– volume: 1
  start-page: 211
  year: 1936
  ident: 10.1006/jsco.2000.0370_RF36
  article-title: The approximation of one matrix by another of lower rank
  publication-title: Psychometrika
  doi: 10.1007/BF02288367
– ident: 10.1006/jsco.2000.0370_RF73
– volume: 17
  start-page: 371
  year: 1994
  ident: 10.1006/jsco.2000.0370_RF106
  article-title: Fast construction of irreducible polynomials over finite fields
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1994.1025
– ident: 10.1006/jsco.2000.0370_RF39
– start-page: 122
  year: 1969
  ident: 10.1006/jsco.2000.0370_RF93
  article-title: Shift-register synthesis and BCH decoding
  publication-title: IEEE Trans. Inf. Theory IT-15
  doi: 10.1109/TIT.1969.1054260
– ident: 10.1006/jsco.2000.0370_RF80
– year: 1989
  ident: 10.1006/jsco.2000.0370_RF84
– volume: 20
  start-page: 363
  year: 1995
  ident: 10.1006/jsco.2000.0370_RF107
  article-title: A new polynomial factorization algorithm and its implementation
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1995.1055
– ident: 10.1006/jsco.2000.0370_RF3
  doi: 10.1145/258533.258604
– volume: 6
  start-page: 1
  year: 1986
  ident: 10.1006/jsco.2000.0370_RF6
  article-title: On Lovász lattice reduction and the nearest lattice point problem
  publication-title: Combinatorica
  doi: 10.1007/BF02579403
– volume: 9
  start-page: 241
  year: 1990
  ident: 10.1006/jsco.2000.0370_RF23
  article-title: Generalized characteristic polynomials
  publication-title: J. Symb. Comput.
  doi: 10.1016/S0747-7171(08)80012-0
– volume: 15
  start-page: 77
  year: 1981
  ident: 10.1006/jsco.2000.0370_RF85
  article-title: Résolution des systèmes d’équation algébriques
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(81)90064-5
– volume: 117 & 118
  start-page: 229
  year: 1997
  ident: 10.1006/jsco.2000.0370_RF37
  article-title: Certified approximate univariate GCDs
  publication-title: J. Pure Appl. Algebra
  doi: 10.1016/S0022-4049(97)00013-3
– start-page: 54
  year: 1986
  ident: 10.1006/jsco.2000.0370_RF119
  article-title: Solving sparse linear equations over finite fields
  publication-title: IEEE Trans. Inf. Theory IT-32
  doi: 10.1109/TIT.1986.1057137
– ident: 10.1006/jsco.2000.0370_RF33
  doi: 10.1145/190347.190424
– ident: 10.1006/jsco.2000.0370_RF51
– ident: 10.1006/jsco.2000.0370_RF74
– ident: 10.1006/jsco.2000.0370_RF59
– ident: 10.1006/jsco.2000.0370_RF114
– volume: 22
  start-page: 291
  year: 1975
  ident: 10.1006/jsco.2000.0370_RF97
  article-title: Multivariate polynomial factorization
  publication-title: J. ACM
  doi: 10.1145/321879.321890
– volume: 3
  start-page: 655
  year: 1960
  ident: 10.1006/jsco.2000.0370_RF27
  article-title: A method for overlapping and erasure of lists
  publication-title: Commun. ACM
  doi: 10.1145/367487.367501
– ident: 10.1006/jsco.2000.0370_RF48
– ident: 10.1006/jsco.2000.0370_RF108
– ident: 10.1006/jsco.2000.0370_RF60
– year: 1996
  ident: 10.1006/jsco.2000.0370_RF53
– volume: 139
  start-page: 167
  year: 1969
  ident: 10.1006/jsco.2000.0370_RF103
  article-title: The problem of integration in finite terms
  publication-title: Trans. Am. Math. Soc.
  doi: 10.1090/S0002-9947-1969-0237477-8
– ident: 10.1006/jsco.2000.0370_RF40
– volume: 34
  start-page: 995
  year: 1989
  ident: 10.1006/jsco.2000.0370_RF94
  article-title: An elementary proof of Kharitonov’s stability theorem with extensions
  publication-title: IEEE Trans. Autom. Control
  doi: 10.1109/9.35816
– year: 1916
  ident: 10.1006/jsco.2000.0370_RF92
– year: 1960
  ident: 10.1006/jsco.2000.0370_RF45
– volume: 18
  start-page: 505
  year: 1971
  ident: 10.1006/jsco.2000.0370_RF18
  article-title: On Euclid’s algorithm and the theory of subresultants
  publication-title: J. ACM
  doi: 10.1145/321662.321665
– ident: 10.1006/jsco.2000.0370_RF63
  doi: 10.1145/164081.164088
– year: 1992
  ident: 10.1006/jsco.2000.0370_RF67
– start-page: 1
  year: 1989
  ident: 10.1006/jsco.2000.0370_RF13
  article-title: Pseudorandom generators and complexity classes
– volume: 50
  start-page: 274
  year: 1995
  ident: 10.1006/jsco.2000.0370_RF71
  article-title: Effective Noether irreducibility forms and applications
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.1995.1023
– volume: 24
  start-page: 563
  year: 1997
  ident: 10.1006/jsco.2000.0370_RF65
  article-title: Rectifying transformations for the integration of rational trigonometric functions
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1997.0152
– ident: 10.1006/jsco.2000.0370_RF100
– ident: 10.1006/jsco.2000.0370_RF86
– ident: 10.1006/jsco.2000.0370_RF43
– ident: 10.1006/jsco.2000.0370_RF7
– ident: 10.1006/jsco.2000.0370_RF99
– ident: 10.1006/jsco.2000.0370_RF57
– ident: 10.1006/jsco.2000.0370_RF38
– volume: 261
  start-page: 515
  year: 1982
  ident: 10.1006/jsco.2000.0370_RF88
  article-title: Factoring polynomials with rational coefficients
  publication-title: Math. Ann.
  doi: 10.1007/BF01457454
– start-page: 467
  year: 1988
  ident: 10.1006/jsco.2000.0370_RF72
  article-title: Improved sparse multivariate polynomial interpolation algorithms
– year: 1996
  ident: 10.1006/jsco.2000.0370_RF98
– ident: 10.1006/jsco.2000.0370_RF52
– volume: 6
  start-page: 1
  year: 1993
  ident: 10.1006/jsco.2000.0370_RF102
  article-title: Checking robust nonsingularity is NP-hard
  publication-title: Math. Control Signals Syst.
  doi: 10.1007/BF01213466
– year: 1979
  ident: 10.1006/jsco.2000.0370_RF4
– start-page: 184
  year: 1985
  ident: 10.1006/jsco.2000.0370_RF21
  article-title: Gröbner bases: An algorithmic method in polynomial ideal theory
– volume: 9
  start-page: 757
  year: 1966
  ident: 10.1006/jsco.2000.0370_RF68
  article-title: Numerical linear algebra
  publication-title: Can. Math. Bull.
  doi: 10.4153/CMB-1966-083-2
– year: 1997
  ident: 10.1006/jsco.2000.0370_RF16
– ident: 10.1006/jsco.2000.0370_RF83
– year: 1956
  ident: 10.1006/jsco.2000.0370_RF2
– volume: 1
  start-page: 35
  year: 1992
  ident: 10.1006/jsco.2000.0370_RF54
  article-title: Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
  publication-title: Optimization Methods & Software
  doi: 10.1080/10556789208805505
– start-page: 294
  year: 1992
  ident: 10.1006/jsco.2000.0370_RF70
  article-title: Polynomial factorization 1987–1991
– ident: 10.1006/jsco.2000.0370_RF1
  doi: 10.1145/32439.32444
– year: 1999
  ident: 10.1006/jsco.2000.0370_RF46
– ident: 10.1006/jsco.2000.0370_RF35
– volume: 66
  start-page: 903
  year: 1997
  ident: 10.1006/jsco.2000.0370_RF8
  article-title: On the rapid computation of various polylogarithmic constants
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-97-00856-9
SSID ssj0009435
Score 1.7751162
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 891
Title Challenges of Symbolic Computation: My Favorite Open Problems
Volume 29
WOSCitedRecordID wos000087972800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0747-7171
  databaseCode: AIEXJ
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 20180228
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0009435
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PS8MwFA46PXjxt_ibHAQPo9o1bZN4k6GoMBGcsNtImgQF7WSb4v57X9ak69SBHryEEpK0zdd8eUlf3ofQkTZhTHWoAsNUGMRKi0DIOAVAUgn2AxOUqrHYBL29ZZ0Ov3MC44OxnADNc_bxwV__FWrIA7Dt0dk_wF02ChlwDaBDCrBD-ivgm14eZeykcT96kTb0b72Qbyh9OVqj-qV47_XB4qxbpxJ7YsAqywxmWKsD3042aacka_E87Bm3kwO8-ji1lRBOXJ4c48DaIoD1XaNKj25D4ukb17FCZstNm7xgvm-MDKPaMrL9A21veRKSQihkOvT1lympdBQsgiqnXVvfKmaGXVt_Hi1ENOGshhbOry86N5Moy3GhqOrfw0fpDNPT6SeoWCEVc6K9ipZdz-LzAr81NKfzdbTiNTawo9wNVIET9wz2cOIKnGe4NcIeTGzBxB7MTfRwedFuXgVO8iLIIkKHgaRgQjdSQ5WhUgtOVGQoyZJEN5hhRkdCacLTRBIwzVQGMwSFFXmqQkMkZ5qTLVTLe7neRjgiWnIYhlrKNNaGCMkTYUXlTKQaUZbtoMB3QTdz8eCtLMlz9-dO30HHZfnXIhLKjJK7vy65h5Ym3-E-qg37b_oALWbvw6dB_9Ch-wk7oVYq
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Challenges+of+Symbolic+Computation%3A+My+Favorite+Open+Problems&rft.jtitle=Journal+of+symbolic+computation&rft.au=Kaltofen%2C+Erich&rft.date=2000-06-01&rft.issn=0747-7171&rft.volume=29&rft.issue=6&rft.spage=891&rft.epage=919&rft_id=info:doi/10.1006%2Fjsco.2000.0370&rft.externalDBID=n%2Fa&rft.externalDocID=10_1006_jsco_2000_0370
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0747-7171&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0747-7171&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0747-7171&client=summon