The DOI matches its Crossref record; 21 of the 30 references it cites were found in a registry or an index.
Self-testing/correcting with applications to numerical problems
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
“If the BLR test is run n times, then we can conclude that PC(K,V) is linear with probability 1-2⁻ⁿ.”
From Cube attacks on round-reduced TinyJAMBU (2022) · cites this paper as [19]
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Approximate formulas for some functions of prime numbers
Rosser, J. B., & Schoenfeld, L. (1962) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255631807 · Cited by 1,596
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. M. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,309
Self-citationSchnelle Multiplikation großer Zahlen
Schönhage, A., & Strassen, V. (1971) · Computing · doi:10.1007/bf02242355 · Cited by 1,107
Trading group theory for randomness
Babai, L. (1985) · doi:10.1145/22145.22192 · Cited by 781
Multi-prover interactive proofs: how to remove intractability
Ben-Or, M., Goldwasser, S., Kilian, J., & Widgerson, A. (1988) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/62212.62223 · Cited by 471
Monte-Carlo approximation algorithms for enumeration problems
Karp, R. M., Luby, M. G., & Madras, N. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90038-2 · Cited by 323
Self-citationLipton, R. (1991) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/002/13 · Cited by 270
Research works printed but not linked: 2
- Beigel, 1990, On the Complexity of Coherent Sets, AT & T Technical Memorandum
- Cleve, 1990, A Note on Self-Testing/Correcting Methods for Trigonometric Functions, ICSI Technical Report TR-90-032
Cited by
Sorted by citations
Items 101–200 of 696
New publicly verifiable computation for batch matrix multiplication
Zhang, X., Jiang, T., Li, K., Castiglione, A., & Chen, X. (2017) · Information Sciences · doi:10.1016/j.ins.2017.11.063 · Cited by 53
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
Alon, N., Fischer, E., & Newman, I. (2007) · SIAM Journal on Computing · doi:10.1137/050627915 · Cited by 52
Testing Low-Degree Polynomials over Prime Fields
Jutla, C. S., Patthak, A. C., Atri Rudra, B., & Zuckerman, D. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.64 · Cited by 52
Locally Decodable Codes and Private Information Retrieval Schemes
Yekhanin, S. (2010) · Information security and cryptography · doi:10.1007/978-3-642-14358-8 · Cited by 51
Buhrman, H., Fortnow, L., Newman, I., & Röhrig, H. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539704442416 · Cited by 56
Regular languages are testable with a constant number of queries
Alon, N., Newman, I., Krivelevich, M., & Szegedy, M. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814641 · Cited by 51
A combination of testability and decodability by tensor products
Viderman, M. (2013) · Random Structures and Algorithms · doi:10.1002/rsa.20498 · Cited by 50
Cao, Y., Zhou, Z. Q., & Chen, T. Y. (2013) · Asia-Pacific Conference on Quality Software (APAQS) · doi:10.1109/qsic.2013.43 · Cited by 50
Local Monotonicity Reconstruction
Saks, M., & Seshadhri, C. (2010) · SIAM Journal on Computing · doi:10.1137/080728561 · Cited by 48
On the Local Leakage Resilience of Linear Secret Sharing Schemes
Benhamouda, F., Degwekar, A., Ishai, Y., & Rabin, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96884-1_18 · Cited by 48
Testing Problems with Sublearning Sample Complexity
Kearns, M. J., & Ron, D. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1656 · Cited by 48
On Dinur’s proof of the PCP theorem
Radhakrishnan, J., & Sudan, M. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01143-8 · Cited by 48
Almost Orthogonal Linear Codes are Locally Testable
Kaufman, T., & Litsyn, S. N. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.16 · Cited by 47
Property Testing in Computational Geometry
Czumaj, A., Sohler, C., & Ziegler, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45253-2_15 · Cited by 46
Testing properties of directed graphs: acyclicity and connectivity
Bender, M. A., & Ron, D. (2002) · Random Structures and Algorithms · doi:10.1002/rsa.10023 · Cited by 46
Testing Membership in Languages that Have Small Width Branching Programs
Newman, I. (2002) · SIAM Journal on Computing · doi:10.1137/s009753970038211x · Cited by 46
Locality and checkability in wait-free computing
Fraigniaud, P., Rajsbaum, S., & Travers, C. (2013) · Distributed Computing · doi:10.1007/s00446-013-0188-x · Cited by 46
Computationally efficient error-correcting codes and holographic proofs
Spielman, D. A., & Sipser, M. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 46
A proof of Green's conjecture regarding the removal properties of sets of linear equations
Shapira, A., Memory, D., & Schramm, O. (2008) · Cited by 44
Vidick, T., & Watrous, J. (2016) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000068 · Cited by 44
Side Channel Cube Attack on PRESENT
Yang, L., Wang, M., & Qiao, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10433-6_25 · Cited by 43
Distribution-Free Property-Testing
Halevy, S., & Eyal Kushilevitz, Z. (2007) · SIAM Journal on Computing · doi:10.1137/050645804 · Cited by 43
Unconditional pseudorandom generators for low degree polynomials
Lovett, S. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374455 · Cited by 43
Alon, N., Dar, S., Parnas, M., & Ron, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892111 · Cited by 43
Testing Polynomials over General Fields
Kaufman, T., & Ron, D. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.65 · Cited by 43
Introduction to Testing Graph Properties
Goldreich, O. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16367-8_7 · Cited by 42
Inverse conjecture for the gowers norm is false
Lovett, S., Meshulam, R., & Samorodnitsky, A. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374454 · Cited by 42
Batch verification with applications to cryptography and checking
Mihir Bellare, Y., Garay, J. A., & Rabin, T. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054320 · Cited by 42
Towards Self-Testing in Autonomic Computing Systems
King, T. M., Babich, D., Alava, J., Clarke, P., & Stevens, R. (2007) · International Symposium on Autonomous Decentralized Systems · doi:10.1109/isads.2007.75 · Cited by 41
Testing versus estimation of graph properties
Fischer, E., & Newman, I. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060612 · Cited by 41
A Unified Framework for Testing Linear-Invariant Properties
Bhattacharyya, A., Grigorescu, E., & Shapira, A. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.53 · Cited by 40
Nearly complete graphs decomposable into large induced matchings and their applications
Alon, N., Moitra, A., & Benny Sudakov, C. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2214074 · Cited by 40
The growth rate of tri-colored sum-free sets
Kleinberg, R., Sawin, W., & Speyer, D. E. (2018) · Discrete Analysis · doi:10.19086/da.3734 · Cited by 40
Locally testable codes and PCPs of almost-linear length
Goldreich, O., & Sudan, M. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181878 · Cited by 40
Secure outsourcing of modular exponentiations under single untrusted programme model
Ding, Y., Xu, Z., Ye, J., & Choo, K. R. (2016) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2016.11.005 · Cited by 39
Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA
Natarajan, A., & Vidick, T. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00075 · Cited by 39
Approximating the distance to monotonicity in high dimensions
Fattal, S., & Ron, D. (2010) · ACM Transactions on Algorithms · doi:10.1145/1798596.1798605 · Cited by 38
Gowers Uniformity, Influence of Variables, and PCPs
Samorodnitsky, A., & Trevisan, L. (2009) · SIAM Journal on Computing · doi:10.1137/070681612 · Cited by 38
Fast approximate probabilistically checkable proofs
Ergün, F., Kumar, R., & Rubinfeld, R. (2003) · Information and Computation · doi:10.1016/j.ic.2003.09.005 · Cited by 38
Self-citationGreen's conjecture and testing linear-invariant properties
Shapira, A. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536438 · Cited by 37
An empirical comparison between direct and indirect test result checking approaches
Hu, P., Zhang, Z., Chan, W. K., & Tse, T. H. (2006) · doi:10.1145/1188895.1188901 · Cited by 37
Verifying and decoding in constant depth
Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., & Rothblum, G. N. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250855 · Cited by 37
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games
Harrow, A. W., & Montanaro, A. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.66 · Cited by 37
High dimensional expanders and property testing
Kaufman, T., & Lubotzky, A. (2014) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2554797.2554842 · Cited by 37
Sparse Random Linear Codes are Locally Decodable and Testable
Kaufman, T., & Sudan, M. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.8 · Cited by 37
Fault-based testing in the absence of an oracle
Chen, T. Y., Tse, T. H., & Zhou, Z. Q. (2002) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/cmpsac.2001.960614 · Cited by 36
Program result-checking: a theory of testing meets a test of theory
Blum, M., & Wasserman, H. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365678 · Cited by 35
Self-citationOn the Local Leakage Resilience of Linear Secret Sharing Schemes
Benhamouda, F., Degwekar, A., Ishai, Y., & Rabin, T. (2021) · Journal of Cryptology · doi:10.1007/s00145-021-09375-2 · Cited by 35
Verifiable Computation over Large Database with Incremental Updates
Chen, X., Li, J., Weng, J., Ma, J., & Lou, W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11203-9_9 · Cited by 35
Recognizing well-parenthesized expressions in the streaming model
Magniez, F., Mathieu, C., & Nayak, A. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806727 · Cited by 35
Tests and tolerances for high-performance software-implemented fault detection
Turmon, M., Granat, R. A., Katz, D. S., & Lou, J. Z. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1197125 · Cited by 35
Functions that have read‐twice constant width branching programs are not necessarily testable
Fischer, E., Newman, I., & Sgall, J. (2004) · Random Structures and Algorithms · doi:10.1002/rsa.10110 · Cited by 35
Structure and Randomness in Combinatorics
Tao, T. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.17 · Cited by 35
Fischer, E., & Newman, I. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380812 · Cited by 35
Property testing of unitary operators
Wang, G. (2011) · Physical Review A · doi:10.1103/physreva.84.052328 · Cited by 34
A separation theorem in property testing
Alon, N., & Shapira, A. (2008) · COMBINATORICA · doi:10.1007/s00493-008-2321-1 · Cited by 34
On Testing Computability by Small Width OBDDs
Goldreich, O. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15369-3_43 · Cited by 33
Large values of the Gowers-Host-Kra seminorms
Eisner, T., & Tao, T. (2012) · Journal d Analyse Mathématique · doi:10.1007/s11854-012-0018-2 · Cited by 33
Local List-Decoding and Testing of Random Linear Codes from High Error
Kopparty, S., & Saraf, S. (2010) · SIAM Journal on Computing · doi:10.1137/100811945 · Cited by 31
Fischer, E., & Matsliah, A. (2008) · SIAM Journal on Computing · doi:10.1137/070680795 · Cited by 33
An effective testing method for end-user programmers
Chen, T. Y., Kuo, F., & Zhou, Z. Q. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1082983.1083236 · Cited by 32
Introduction to Testing Graph Properties
Goldreich, O. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22670-0_32 · Cited by 32
Invariance in Property Testing
Sudan, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16367-8_12 · Cited by 32
Tolerant Linearity Testing and Locally Testable Codes
Kopparty, S., & Saraf, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03685-9_45 · Cited by 32
Every locally characterized affine-invariant property is testable
Bhattacharyya, A., Fischer, E., Hatami, H., Hatami, P., & Lovett, S. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488662 · Cited by 31
Analogy-preserving functions: A way to extend Boolean samples
Couceiro, M., Hug, N., Prade, H. M., & Richard, G. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/218 · Cited by 31
Communication Complexity and Secure Function EvaluationPreprint
Naor, M., & Kobbi Nissim, B. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0109011 · Cited by 31
Intermittent Failures in Hardware and Software
Bakhshi, R., Kunche, S., & PECHT, M. G. (2014) · Journal of Electronic Packaging · doi:10.1115/1.4026639 · Cited by 30
Investigating Cube Attacks on the Authenticated Encryption Stream Cipher ACORN
Salam, I., Bartlett, H., Dawson, E., Pieprzyk, J., Simpson, L. R., & Wong, K. K. (2016) · Communications in computer and information science · doi:10.1007/978-981-10-2741-3_2 · Cited by 30
The Cube Attack on Stream Cipher Trivium and Quadraticity Tests
Mroczkowski, P., & Szmidt, J. (2012) · Fundamenta Informaticae · doi:10.3233/fi-2012-631 · Cited by 30
Miao, M., Ma, J., Huang, X., & Wang, Q. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2758746 · Cited by 30
A sublinear bipartiteness tester for bounded degree graphs
Goldreich, O., & Ron, D. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276767 · Cited by 30
Linearity testing in characteristic two
Mihir Bellare, Y., Coppersmith, D., Håstad, J., Kiwi, M. A., & Sudan, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492574 · Cited by 30
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
Kaufman, T., Litsyn, S. N., & Xie, N. (2010) · SIAM Journal on Computing · doi:10.1137/080715548 · Cited by 29
Marchiolli, M. A., & Ruzzi, M. (2012) · Annals of Physics · doi:10.1016/j.aop.2012.02.015 · Cited by 29
Distribution-Free Property Testing
Halevy, S., & Eyal Kushilevitz, Z. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45198-3_26 · Cited by 29
The distribution of polynomials over finite fields, with applications to the Gowers normsPreprint
Green, B., & Tao, T. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0711.3191 · Cited by 29
A Fourier-Analytic Approach to Reed-Muller Decoding
Gopalan, P. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.71 · Cited by 27
Property Testing Lower Bounds via Communication Complexity
Blais, E., Brody, J., & Matulef, K. (2011) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2011.31 · Cited by 28
Testing Fourier Dimensionality and Sparsity
Gopalan, P., O’Donnell, R., Servedio, R. A., Shpilka, A., & Wimmer, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02927-1_42 · Cited by 27
Experimental Study to Compare the Use of Metamorphic Testing and Assertion Checking
Zhang, Z., Chan, W. K., Tse, T. H., & Pei-Feng, H. U. (2009) · Journal of Software · doi:10.3724/sp.j.1001.2009.00578 · Cited by 26
2-Transitivity Is Insufficient for Local Testability
Grigorescu, E., Kaufman, T., & Sudan, M. (2008) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2008.31 · Cited by 26
Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems
Goldreich, O., & Rothblum, G. N. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00017 · Cited by 31
Approximate checking of polynomials and functional equations
Ergün, F., Kumar, S. R., & Rubinfeld, R. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548518 · Cited by 26
Self-citationSome 3CNF properties are hard to test
Ben‐Sasson, E., Harsha, P., & Raskhodnikova, S. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780594 · Cited by 26
Software-implemented fault detection for high-performance space applications
Turmon, M., Granat, R. A., & Katz, D. S. (2002) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/icdsn.2000.857522 · Cited by 25
Testing low‐degree polynomials over prime fields
Jutla, C. S., Patthak, A. C., Rudra, A., & Zuckerman, D. (2009) · Random Structures and Algorithms · doi:10.1002/rsa.20262 · Cited by 25
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP
Engebretsen, L., & Holmerin, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31856-9_16 · Cited by 25
Self-testing of universal and fault-tolerant sets of quantum gates
van Dam, W., Magniez, F., Mosca, M., & Sántha, M. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335402 · Cited by 26
Fast Distributed Algorithms for Testing Graph Properties
Censor-Hillel, K., Fischer, E., Schwartzman, G., & Vasudev, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53426-7_4 · Cited by 24
A New Framework for Finding Nonlinear Superpolies in Cube Attacks Against Trivium-Like Ciphers
Ye, C.-D., & Tian, T. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93638-3_11 · Cited by 24
Derandomizing homomorphism testing in general groups
Shpilka, A., & Wigderson, A. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007421 · Cited by 24
Probabilistic abstraction for model checking
Laplante, S., Lassaigne, R., Magniez, F., Sylvain Peyronnet, D., & de Rougemont, M. (2007) · ACM Transactions on Computational Logic · doi:10.1145/1276920.1276922 · Cited by 23
Succinct Representation of Codes with Applications to Testing
Grigorescu, E., Kaufman, T., & Sudan, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03685-9_40 · Cited by 23
Test for a large amount of entanglement, using few measurements
Chao, R., Reichardt, B. W., Sutherland, C., & Vidick, T. (2018) · Quantum · doi:10.22331/q-2018-09-03-92 · Cited by 29
Local correctability of expander codes
Hemenway, B., Ostrovsky, R., & Wootters, M. K. (2014) · Information and Computation · doi:10.1016/j.ic.2014.12.013 · Cited by 23
A (de)constructive approach to program checking
Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., & Rothblum, G. N. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374399 · Cited by 23
Learning Fallible Deterministic Finite Automata
Ron, D., & Rubinfeld, R. (1995) · Machine Learning · doi:10.1007/bf00993409 · Cited by 24
Self-citationA Metabolic Approach to Protocol Resilience
Tschudin, C., & Yamamoto, L. (2005) · Lecture notes in computer science · doi:10.1007/11520184_15 · Cited by 23
Tight Bounds for Testing k-Linearity
Blais, E., & Kane, D. M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32512-0_37 · Cited by 22
Metadata
- Authors
- Blum, M., Luby, M., & Rubinfeld, R.
- Affiliations
- University of California, Berkeley (US)
- International Computer Science Institute (US)
- Cornell University (US)
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1993-12
- Volume
- 47
- Issue
- 3
- Pages
- 549-595
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W3004537778
- Cited by
- 712
- References
- 30
- Citations by year
- 2026: 4 · 2025: 12 · 2024: 8 · 2023: 8 · 2022: 23 · 2021: 19 · 2020: 26 · 2019: 17 · 2018: 24 · 2017: 21 · 2016: 31 · 2015: 27 · 2014: 25 · 2013: 35 · 2012: 33
- FWCI
- 6.50
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Computer and System Sciences (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Keywords
- fault-tolerant computation, numerical algorithms, integer multiplication, modular multiplication, matrix multiplication, matrix inversion, matrix determinants, matrix rank, integer division, modular exponentiation, polynomial multiplication, program correctness
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
