Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,000,569 papers from all fields of science
Search
Sign In
Create Free Account
Binary logarithm
Known as:
Logarithmus dualis
, Log2
, Logarithmus binaris
Expand
In mathematics, the binary logarithm (log2 n) is the power to which the number 2 must be raised to obtain the value n. That is, for any real number x…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Algorithm
Analysis of algorithms
Binary entropy function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Visual SLAM: Why filter?
H. Strasdat
,
J. Montiel
,
A. Davison
Image and Vision Computing
2012
Corpus ID: 924291
Highly Cited
2011
Highly Cited
2011
Energy and Spectral Efficiency of Very Large Multiuser MIMO Systems
H. Ngo
,
E. Larsson
,
T. Marzetta
IEEE Transactions on Communications
2011
Corpus ID: 3332631
A multiplicity of autonomous terminals simultaneously transmits data streams to a compact array of antennas. The array uses…
Expand
Highly Cited
2008
Highly Cited
2008
Iterative Hard Thresholding for Compressed Sensing
T. Blumensath
,
M. Davies
ArXiv
2008
Corpus ID: 9315983
Highly Cited
2006
Highly Cited
2006
Local Graph Partitioning using PageRank Vectors
R. Andersen
,
F. Graham
,
Kevin J. Lang
IEEE Annual Symposium on Foundations of Computer…
2006
Corpus ID: 206656317
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on…
Expand
Highly Cited
1999
Highly Cited
1999
Recursive PCA for adaptive process monitoring
Weihua Li
,
H. Yue
,
S. Valle‐Cervantes
,
S. Qin
1999
Corpus ID: 44225856
Review
1990
Review
1990
Fast Fourier transforms: a tutorial review and a state of the art
P. Duhamel
,
M. Vetterli
1990
Corpus ID: 62081471
Highly Cited
1987
Highly Cited
1987
Speeding the Pollard and elliptic curve methods of factorization
P. L. Montgomery
1987
Corpus ID: 4262792
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module…
Expand
Highly Cited
1973
Highly Cited
1973
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
P. Kogge
,
H. Stone
IEEE transactions on computers
1973
Corpus ID: 206619926
An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf…
Expand
Highly Cited
1972
Highly Cited
1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
J. Edmonds
,
R. Karp
Combinatorial Optimization
1972
Corpus ID: 6375478
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum…
Expand
Highly Cited
1962
Highly Cited
1962
Computer Multiplication and Division Using Binary Logarithms
John N. Mitchell
IRE Transactions on Electronic Computers
1962
Corpus ID: 46108458
A method of computer multiplication and division is proposed which uses binary logarithms. The logarithm of a binary number may…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE