Effective electronic marking for on-line assessment
- 期刊名称ACM SIGCSE Bulletin
- 作者Joy, Mike; Luck, Michael
- 卷第30卷
- 期第3期
- 印刷ISSN0097-8418
- 文件大小799.17KB
- 发表时间1998-09-01
- DOI10.1145/290320.283096
- 页码134-138
[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - A polynomial-time reduction from bivariate to univariate integral polynomial factorizationKaltofen, Erich; Kaltofen, Erich; Kaltofen, Erich; Kaltofen, Erich · 1982
Teaching Computational Abstract AlgebraERICH KALTOFEN · 1997
Factoring sparse multivariate polynomialsJoachim von zur Gathen; Erich Kaltofen · 1985
Special issue computational algebraic complexity editorialErich Kaltofen; Bruno Buchberger · 1990
Fast parallel absolute irreducibility testingErich Kaltofen · 1985
On the complexity of computing determinantsErich Kaltofen; Gilles Villard · Computational Complexity · 2005
Efficiently Certifying Non-Integer PowersErich Kaltofen; Mark Lavin · 2010
Effective Hilbert irreducibilityErich Kaltofen · 1985
Small algorithms for small systemsDavenport, James H. · ACM Communications in Computer Algebra · 2012
Symbolic computation of Fenchel conjugatesBauschke, Heinz H.; Mohrenschildt, Martin v. · ACM Communications in Computer Algebra · 2006
OSCASJoyner, David · ACM Communications in Computer Algebra · 2006
GAPLinton, Steve · ACM Communications in Computer Algebra · 2007
Remembering Richard Crandall (1947--2012)Wolfram, Stephen · ACM Communications in Computer Algebra · 2013
Series misdemeanorsStoutemyer, David R. · ACM Communications in Computer Algebra · 2013
Block Wiedemann algorithm on multicore architecturesVialla, Bastien · ACM Communications in Computer Algebra · 2014
DISCOVERERXia, Bican · ACM Communications in Computer Algebra · 2007