The DOI matches its Crossref record; 7 of the 8 references it cites were found in a registry or an index.
Matrix multiplication via arithmetic progressions
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“With the use of the Coppersmith-Winograd algorithm, the time complexity of both the KF-based algorithms can be reduced from O ( m 3 ) to O ( m 2 . 375 ) .”
From Real-Time Performance Assessment of High-Order Tremor Estimators Used in a Wearable Tremor Suppression Device (2022) · cites this paper as [41]
In the citing paper
“Therefore, to reduce the time complexity of the KFbased algorithms, a Coppersmith-Winograd algorithm [41] can be used to optimize the matrix operation.”
From Real-Time Performance Assessment of High-Order Tremor Estimators Used in a Wearable Tremor Suppression Device (2022) · cites this paper as [41]
In the citing paper
“It was identified that the use of a Coppersmith-Winograd algorithm can largely reduce the time complexity of the KFbased algorithm to a similar level as the BMFLC.”
From Real-Time Performance Assessment of High-Order Tremor Estimators Used in a Wearable Tremor Suppression Device (2022) · cites this paper as [41]
Citations
Cites
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Behrend, F. A. (1946) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.32.12.331 · Cited by 414
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 279
On the Asymptotic Complexity of Matrix Multiplication
Coppersmith, D., & Winograd, S. (1982) · SIAM Journal on Computing · doi:10.1137/0211038 · Cited by 221
Self-citationHow to Multiply Matrices Faster
(1984) · Lecture notes in computer science · doi:10.1007/3-540-13866-8 · Cited by 147
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Salem, R., & Spencer, D. C. (1942) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.28.12.561 · Cited by 134
Pan, V. Y. (1978) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1978.34 · Cited by 121
The asymptotic spectrum of tensors and the exponent of matrix multiplication
Strassen, V. (1986) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1986.52 · Cited by 120
Cited by
Sorted by citations
Items 301–400 of 1,001
Message-Passing Algorithms for Counting Short Cycles in a Graph
Karimi, M., & Banihashemi, A. H. (2012) · IEEE Transactions on Communications · doi:10.1109/tcomm.2012.100912.120503 · Cited by 60
On the Complexity of Sparse Elimination
Emiris, I. Z. (1996) · Journal of Complexity · doi:10.1006/jcom.1996.0010 · Cited by 60
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
Chekuri, C., & Bender, M. A. (2001) · Journal of Algorithms · doi:10.1006/jagm.2001.1184 · Cited by 60
Linear time low tree-width partitions and algorithmic consequences
Nešetřil, J., & de Mendez, P. O. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132575 · Cited by 60
Bockmayr, A., Weispfenning, V., & Maher, M. J. (2001) · Elsevier eBooks · doi:10.1016/b978-044450813-3/50014-x · Cited by 60
A space and time efficient algorithm for SimRank computation
Yu, W., Zhang, W., Lin, X., Zhang, Q., & Le, J. (2010) · World Wide Web · doi:10.1007/s11280-010-0100-6 · Cited by 59
Fomin, F. V., & Kaski, P. (2013) · Communications of the ACM · doi:10.1145/2428556.2428575 · Cited by 65
On computing determinants of matrices without divisions
Kaltofen, E. (1992) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/143242.143350 · Cited by 59
Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication.
Tamaki, H., & Tokuyama, T. (2000) · Interdisciplinary Information Sciences · doi:10.4036/iis.2000.99 · Cited by 59
A General Approach to Removing Degeneracies
Emiris, I. Z., & Canny, J. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792235918 · Cited by 59
Conjunctive and Boolean grammars: The true general case of the context-free grammars
Okhotin, A. (2013) · Computer Science Review · doi:10.1016/j.cosrev.2013.06.001 · Cited by 61
Rosta, V. (2004) · The Electronic Journal of Combinatorics · doi:10.37236/34 · Cited by 58
Sublinear Scaling for Multi-Client Private Information Retrieval
Lueks, W., & Goldberg, I. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47854-7_10 · Cited by 60
Efficient and Secure Delegation of Linear Algebra.
Mohassel, P. (2011) · Cited by 58
Tensor Rank: Some Lower and Upper Bounds
Alexeev, B., Forbes, M. A., & Tsimerman, J. (2011) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2011.28 · Cited by 58
Approximating average parameters of graphs
Goldreich, O., & Ron, D. (2008) · Random Structures and Algorithms · doi:10.1002/rsa.20203 · Cited by 57
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Baswana, S., Hariharan, R., & Sen, S. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2004.08.004 · Cited by 57
Fast computation of special resultants
Bostan, A., Flajolet, P., Salvy, B., & Schost, É. (2005) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2005.07.001 · Cited by 64
Optimizing matrix multiplication for a short-vector SIMD architecture – CELL processor
Jakub Kurzak, A., Alvaro, W., & Dongarra, J. J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.12.010 · Cited by 57
A Refined Laser Method and Faster Matrix Multiplication
Alman, J., & Williams, V. V. (2024) · TheoretiCS · doi:10.46298/theoretics.24.21 · Cited by 76
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
Takaoka, T. (1998) · Algorithmica · doi:10.1007/pl00009198 · Cited by 57
Greenlaw, R., & Petreschi, R. (1995) · ACM Computing Surveys · doi:10.1145/234782.234783 · Cited by 57
A Survey of Shortest-Path AlgorithmsPreprint
Madkour, A., Aref, W. G., Rehman, F. U., Rahman, M. A., & Basalamah, S. M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.02044 · Cited by 57
Improved Error Bounds for Inner Products in Floating-Point Arithmetic
Jeannerod, C.-P., & Rump, S. M. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120894488 · Cited by 61
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
Chan, T. M. (2006) · doi:10.5555/1109557.1109614 · Cited by 56
Subgroup Discovery Meets Bayesian Networks -- An Exceptional Model Mining Approach
Duivesteijn, W., Knobbe, A., Feelders, A., & van Leeuwen, M. (2010) · Proceedings · doi:10.1109/icdm.2010.53 · Cited by 57
Dynamic Programming and Fast Matrix Multiplication
Dorn, F. (2006) · Lecture notes in computer science · doi:10.1007/11841036_27 · Cited by 56
Maximum weight bipartite matching in matrix multiplication time
Sankowski, P. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.07.028 · Cited by 56
An LLL-reduction algorithm with quasi-linear time complexity
Novocin, A., Stehlé, D., & Villard, G. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993691 · Cited by 55
Modular code generation from synchronous block diagrams
Lublinerman, R., Szegedy, C., & Tripakis, S. (2009) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1480881.1480893 · Cited by 55
Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications
Bertoni, G., Guajardo, J., Kumar, S., Orlando, G., Paar, C., & Wollinger, T. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_11 · Cited by 55
Solving Degenerate Sparse Polynomial Systems Faster
Rojas, J. M. (1999) · Journal of Symbolic Computation · doi:10.1006/jsco.1998.0271 · Cited by 55
An O(n2 algorithm for circular-arc graph recognition
Eschen, E. M., & Sinrad, J. P. (1993) · Symposium on Discrete Algorithms · doi:10.5555/313559.313637 · Cited by 55
Soft Linear Precoding for the Downlink of DS/CDMA Communication Systems
Masouros, C., & Alsusa, E. A. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2026906 · Cited by 54
Implementing Minimum Cycle Basis Algorithms
Mehlhorn, K., & Michail, D. (2005) · Lecture notes in computer science · doi:10.1007/11427186_5 · Cited by 54
Fast and Efficient Parallel Solution of Sparse Linear Systems
Pan, V. Y., & Reif, J. H. (1993) · SIAM Journal on Computing · doi:10.1137/0222073 · Cited by 54
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
Hsu, W., & Ma, T.-H. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539792224814 · Cited by 54
Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
Angelsmark, O. (2005) · DiVA (Linkoping University) · Cited by 54
A scaling algorithm for maximum weight matching in bipartite graphs
Duan, R., & Su, H.-H. (2012) · Cited by 53
Computing the Fréchet distance between simple polygons
Buchin, K., Buchin, M., & Wenk, C. (2008) · Computational Geometry · doi:10.1016/j.comgeo.2007.08.003 · Cited by 55
On the memory complexity of the forward–backward algorithm
Khreich, W., Granger, É., Miri, A., & Sabourin, R. (2009) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.023 · Cited by 53
Szemerédi’s Regularity Lemma and Quasi-randomness
Kohayakawa, Y., & Rödl, V. (2003) · Springer eBooks · doi:10.1007/0-387-22444-0_9 · Cited by 53
Regularity Lemmas and Combinatorial Algorithms
Bansal, N., & Williams, R. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.76 · Cited by 54
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
Natanzon, A., Ron Shamir, A., & Sharan, R. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798336073 · Cited by 52
Normal mode analysis of proteins: a comparison of rigid cluster modes with C coarse graining
Schuyler, A. D., & Chirikjian, G. S. (2003) · Journal of Molecular Graphics and Modelling · doi:10.1016/s1093-3263(03)00158-x · Cited by 52
The Complexity of Factors of Multivariate Polynomials
Bürgisser, P. (2004) · Foundations of Computational Mathematics · doi:10.1007/s10208-002-0059-5 · Cited by 60
Constructing normal bases in finite fields
Gathen, J. V. Z., & Giesbrecht, M. W. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80158-7 · Cited by 52
Feder, T. (1992) · Journal of Graph Theory · doi:10.1002/jgt.3190160508 · Cited by 52
A Faster Algorithm for Minimum Cycle Basis of Graphs
Kavitha, T., Mehlhorn, K., Michail, D., & Paluch, K. E. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27836-8_71 · Cited by 52
Scalable and private media consumption with Popcorn.
Gupta, T., Crooks, N., Setty, S., Alvisi, L., & Walfish, M. (2015) · Cited by 51
Wang, Z., & Li, P. (2020) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2020.3011131 · Cited by 51
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
Abboud, A., Grandoni, F., & Williams, V. V. (2014) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973730.112 · Cited by 59
Constructing Computer Virus Phylogenies
Goldberg, L. A., Goldberg, P. W., Phillips, C. A., & Sorkin, G. B. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0897 · Cited by 51
On The Parameterized Intractability Of Motif Search Problems*
Fellows, M. R., Gramm, J., & Niedermeier, R. (2006) · COMBINATORICA · doi:10.1007/s00493-006-0011-4 · Cited by 50
Strassen's Matrix Multiplication on GPUs
Li, J., Ranka, S., & Sahni, S. K. (2011) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2011.130 · Cited by 52
Parameterized Algorithms for Feedback Vertex Set
Kanj, I. A., Pelsmajer, M. J., & Schaefer, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28639-4_21 · Cited by 50
D’Alberto, P., & Nicolau, A. E. (2007) · Algorithmica · doi:10.1007/s00453-006-1224-z · Cited by 50
Maximum matchings in planar graphs via gaussian elimination
Mucha, M., & Sankowski, P. (2006) · Algorithmica · doi:10.1007/s00453-005-1187-5 · Cited by 53
Substitution decomposition on chordal graphs and applications
Hsu, W., & Ma, T.-H. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54945-5_49 · Cited by 50
Wu, Y., Yu, Z., Xiao, P., & Li, C. (2018) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2018.2832193 · Cited by 49
Geometric complexity theory and tensor rank
Bürgisser, P., & Ikenmeyer, C. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993704 · Cited by 49
Yadav, V., & Michalak, A. M. (2013) · Geoscientific model development · doi:10.5194/gmd-6-583-2013 · Cited by 50
Sharma, A. K., & Paliwal, K. K. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.11.018 · Cited by 49
On the Nuclear Norm and the Singular Value Decomposition of Tensors
Derksen, H. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-015-9264-x · Cited by 53
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)
Williams, R. (2007) · doi:10.5555/1283383.1283490 · Cited by 49
On the complexity of matrix product
Raz, R. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509932 · Cited by 53
RNC-approximation algorithms for the steiner problem
Prömel, H. J., & Steger, A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0023489 · Cited by 49
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
Heggernes, P., Telle, J. A., & Villanger, Y. (2005) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480104445010 · Cited by 54
Rijmen, V., & Bart Preneel, A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052342 · Cited by 48
A Refinement-Based Approach to Computational Algebra in Coq
Dénès, M., Mörtberg, A., & Siles, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32347-8_7 · Cited by 56
Courtois, N. T. (2006) · Lecture notes in computer science · doi:10.1007/11734727_22 · Cited by 48
Fast Generation of Random Spanning Trees and the Effective Resistance Metric
Mądry, A., Straszak, D., & Tarnawski, J. (2014) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973730.134 · Cited by 47
Testing isomorphism of modules
Brooksbank, P. A., & Luks, E. M. (2008) · Journal of Algebra · doi:10.1016/j.jalgebra.2008.07.014 · Cited by 47
The bulk-synchronous parallel random access machine
Tiskin, A. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00197-7 · Cited by 46
Solving structured linear systems with large displacement rank
Bostan, A., Jeannerod, C.-P., & Schost, É. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.05.014 · Cited by 49
Lasso Regression: Estimation and Shrinkage via the Limit of Gibbs Sampling
Rajaratnam, B., Roberts, S., Sparks, D., & Dalal, O. (2015) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/rssb.12106 · Cited by 46
Spectral convergence of graph Laplacian and heat kernel reconstruction in L∞ from random samples
Dunson, D. B., Wu, H., & Wu, N. (2021) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2021.06.002 · Cited by 46
Colored intersection searching via sparse rectangular matrix multiplication
Kaplan, H. Y., Sharir, M., & Verbin, E. (2006) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1137856.1137866 · Cited by 52
The complexity of matrix completion
Harvey, N. J. A., Karger, D. R., & Yekhanin, S. (2006) · doi:10.5555/1109557.1109679 · Cited by 46
Asymptotically fast group operations on Jacobians of general curves
Khuri-Makdisi, K. (2007) · Mathematics of Computation · doi:10.1090/s0025-5718-07-01989-8 · Cited by 46
A scalable parallel Strassen's matrix multiplication algorithm for distributed-memory computers
Luo, Q., & Drake, J. B. (1995) · ACM Symposium on Applied Computing · doi:10.1145/315891.315965 · Cited by 46
An Optimal Algorithm for Checking Regularity
Kohayakawa, Y., Rödl, V., & Thoma, L. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702408223 · Cited by 45
Scalable Algorithms for Data and Network Analysis
Teng, S. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831313 · Cited by 45
Parameterized circuit complexity and the W hierarchy
Downey, R. G., Fellows, M. R., & Regan, K. W. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(96)00317-9 · Cited by 45
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Williams, V. V., Williams, R., & Yuster, R. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250876 · Cited by 45
Parallel Transitive Closure and Point Location in Planar Structures
Tamassia, R., & Vitter, J. S. (1991) · SIAM Journal on Computing · doi:10.1137/0220045 · Cited by 45
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
Demetrescu, C., & Italiano, G. F. (2005) · Journal of the ACM · doi:10.1145/1059513.1059514 · Cited by 44
Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths
Grandoni, F., & Williams, V. V. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.17 · Cited by 44
Minimizing Communication in All-Pairs Shortest Paths
Solomonik, E., Buluç, A., & Demmel, J. W. (2013) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2013.111 · Cited by 46
All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
Chan, T. M. (2012) · ACM Transactions on Algorithms · doi:10.1145/2344422.2344424 · Cited by 48
Peng, Y. K., Li, Q., Kong, W., Qin, F., Zhang, J., & Cichocki, A. S. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106756 · Cited by 44
Wendland, H. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316544938 · Cited by 47
Ambainis, A., Filmus, Y., & Gall, F. L. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746554 · Cited by 61
Fast Multipoint Evaluation of Bivariate Polynomials
Nüsken, M., & Ziegler, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30140-0_49 · Cited by 46
A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
Bruce, D., Hoàng, C. T., & Sawada, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10631-6_61 · Cited by 44
Grasping deformable planar objects: Squeeze, stick/slip analysis, and energy-based optimalities
Jia, Y.-B., Guo, F., & Lin, H. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364913512170 · Cited by 44
Fast polynomial factorization over high algebraic extensions of finite fields
Kaltofen, E., & Shoup, V. (1997) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/258726.258777 · Cited by 44
Error Compensation in Leaf Power Problems
Dom, M., Guo, J., Hüffner, F., & Niedermeier, R. (2005) · Algorithmica · doi:10.1007/s00453-005-1180-z · Cited by 44
Combining zonotopes and support functions for efficient reachability analysis of linear systems
Althoff, M., & Frehse, G. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799418 · Cited by 44
Zwick, U. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30551-4_78 · Cited by 45
Metadata
- Authors
- Coppersmith, D., & Winograd, S.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Venue
- Journal of Symbolic Computation
- Publisher
- Elsevier BV
- Published
- 1990-03
- Volume
- 9
- Issue
- 3
- Pages
- 251-280
- ISSN
- 0747-7171 (ISSN-L)
- OpenAlex
- W1979740015
- Cited by
- 2,248
- References
- 8
- Citations by year
- 2026: 18 · 2025: 29 · 2024: 35 · 2023: 39 · 2022: 42 · 2021: 65 · 2020: 77 · 2019: 92 · 2018: 95 · 2017: 72 · 2016: 64 · 2015: 75 · 2014: 94 · 2013: 112 · 2012: 120
- FWCI
- 34.22
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Symbolic Computation (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Keywords
- matrix multiplication, asymptotic complexity, arithmetic progressions, trilinear forms, Strassen's algorithm, matrix exponent
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
