Live briefing
Everything about Binary splitting
Algorithmic technique
In mathematics, binary splitting is a technique for speeding up numerical evaluation of many types of series with rational terms. In particular, it can be used to evaluate hypergeometric series at rational points. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Binary splittingA 5-minute orientation
- Skim a recent paper: Exploring progress in binary and ternary nanocomposites for photoelectrochemical water splitting: A comprehensive reviewInfluential work since 2022
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: Adaptive binary splitting for efficient RFID tag anti-collisionCited 203 times
- Go sideways: FEE methodA closely related topic
- Go sideways: Karatsuba algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Adaptive binary splitting for efficient RFID tag anti-collision
Binary nickel–iron nitride nanoarrays as bifunctional electrocatalysts for overall water splitting
Binary phase gratings for star couplers with high splitting ratio
A Group-Based Binary Splitting Algorithm for UHF RFID Anti-Collision Systems
Binary arithmetic coding with key-based interval splitting
Binary platinum alloy electrodes for hydrogen and oxygen evolutions by seawater splitting
Beam splitting of low-contrast binary gratings under second Bragg angle incidence
Binary FeCo Oxyhydroxide Nanosheets as Highly Efficient Bifunctional Electrocatalysts for Overall Water Splitting
🆕 Influential since 2022
Exploring progress in binary and ternary nanocomposites for photoelectrochemical water splitting: A comprehensive review
Resolving Massive Black Hole Binary Evolution via Adaptive Particle Splitting
Binary Ni–Cu nanocomposite-modified MXene-adorned 3D-nickel foam for effective overall water splitting and supercapacitor applications
Nanoarchitectonics of binary transition metal phosphides embedded in carbon fibers as a bifunctional electrocatalysts for electrolytic water splitting
A hybrid acoustic cloaking based on binary splitting metasurfaces and near-zero-index metamaterials
📚 Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
A first course in abstract algebraJohn B. Fraleigh · 1967
A First Course in Abstract Algebra [Seventh 7th Edition]John B. Fraleigh · 1969
Pro GitScott Chacon, Ben Straub · 2009
Automate the Boring Stuff with PythonAl Sweigart · 2015
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Fundamentals of data structures in CEllis Horowitz · 1993
Computer algorithmsEllis Horowitz · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- FEE method In mathematics, the FEE method, or fast E-function evaluation method, is the method of fast summation of series of a special form. It was constructed in…
- Karatsuba algorithm The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a…
- Toom–Cook multiplication Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned…
- Multiplication algorithm A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient…
- Integer square root In number theory, the integer square root (isqrt) of a non-negative integer n is the non-negative integer m which is the greatest integer less than or…
- Computational complexity of mathematical operations The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity…
- Schönhage–Strassen algorithm The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers, published by Arnold Schönhage and Volker Strassen…
- Exponentiation by squaring In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number…