Skip to search formSkip to main contentSkip to account menu

Log-space reduction

Known as: Logarithmic-space Turing reduction, Log-space reducible, Logspace reduction 
In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Experimental and empirical data are often analyzed on log-log plots in order to find some scaling argument for the observed… 
Review
2009
Review
2009
We use accurate absolute proper motions and Two-Micron All-Sky Survey K s -band apparent magnitudes for 364 Galactic RR Lyrae… 
2008
2008
A general cumulative damage methodology is derived from the basic relation specifying crack growth rate (increment) as a power… 
2007
2007
This thesis studies the problem of learning mixtures of distributions, a natural formalization of clustering. A mixture of… 
1999
1999
In this paper, a fully pipelined single chip is proposed for LOG-EXP still image compression. The design of the LOG-EXP image… 
1996
1996
Recently a 1978 conjecture by Hartmanis was resolved by Cai and Sivakumar, following progress made by Ogihara. It was shown that… 
Review
1994
Review
1994
In the first two parts of this series (published in the previous two issues of TLE), we discussed an alternative way of… 
1992
1992
The use of continuous GRAPE density measurements for correlating different holes at the same site is based on the presumption… 
1980
1980
STASZ, T. E., G. E. HARMAN, and G. A. MARX. 1980. Time and site of infection of resistant and susceptible germinating pea seeds…