Everything about GCD test

🧭 Start here: a 6-step reading path

1. Read the overview: GCD testA 5-minute orientation
2. Pick up a classic book: From Mathematics to Generic ProgrammingThe most-reprinted book on the subject
3. Read the landmark paper: VHDL Implementation of GCD Processor with Built in Self Test FeatureCited 1 times
4. Go sideways: Loop dependence analysisA closely related topic
5. Go sideways: Dependence analysisA closely related topic

🏆 Landmark papers (most cited)

• VHDL Implementation of GCD Processor with Built in Self Test Feature

  Rekha Devi, Jaget Singh, Mandeep Singh · 2011 · International Journal of Computer Applications · 1 citations

• A test theorem on coherent GCD domains

  Yi Cai Zhao · 1992 · Proceedings of the American Mathematical Society · 0 citations

• A Test Theorem on Coherent GCD Domains

  Zhao Yicai · 1992 · Proceedings of the American Mathematical Society · 0 citations

📚 Books worth reading

• From Mathematics to Generic ProgrammingAlexander A. Stepanov, Daniel E. Rose · 2015

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Loop dependence analysis In computer science, loop dependence analysis is a process which can be used to find dependencies within iterations of a loop with the goal of determining…
• Dependence analysis In compiler theory, dependence analysis produces execution-order constraints between statements/instructions. Broadly speaking, a statement S2 depends…
• Lauricella hypergeometric series In 1893 Giuseppe Lauricella defined and studied four hypergeometric series FA, FB, FC, FD of three variables. They are (Lauricella 1893): FA(3)(a,b1,b2…
• Banerjee test In compiler theory, the Banerjee test is a dependence test. The Banerjee test assumes that all loop indices are independent, however in reality, this is…
• Unique factorization domain In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a…
• Data dependency A data dependency in computer science is a situation in which a program statement (instruction) refers to the data of a preceding statement. In compiler…
• Loop-level parallelism Loop-level parallelism is a form of parallelism in software programming that is concerned with extracting parallel tasks from loops. The opportunity for…
• Euclidean algorithm In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers…