computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually, this means...

SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem...

computational complexity theory, a log space transducer (LST) is a type of Turing machine used for log-space reductions. A log space transducer, M {\displaystyle...

the working space of the algorithm. In theoretical applications such as log-space reductions, it is more typical to always ignore output space (in these...

under the unproven assumption that NC ≠ P. If we use the stronger log-space reduction, this remains true, but additionally we learn that all P-complete...

way. Every non-trivial problem in L is complete under log-space reductions, so weaker reductions are required to identify meaningful notions of L-completeness...

hierarchy, polynomial-time reductions are used. When studying classes within P such as NC and NL, log-space reductions are used. Reductions are also used in computability...

under a log-space reduction. This remains true for the stronger case of first-order reductions (Immerman 1999, p. 51). The log-space reduction from any...

problem in P would be complete. Instead, weaker reductions such as log-space reductions or NC reductions are used for defining classes of complete problems...

projections where each subsequent reduction notion is weaker than the prior; see polynomial-time reduction and log-space reduction for details. Given decision...

generally done by means of a log-space transducer. The main use for log-space computable functions is in log-space reductions. This is a means of transforming...

reduction of A {\displaystyle A} to B {\displaystyle B} that runs in polynomial time. The concept of log-space reduction is similar. These reductions...

complexity of reductions, such as polynomial-time reductions or log-space reductions. The most commonly used reduction is a polynomial-time reduction. This means...

complexity of decision problems. The term L reduction is sometimes used to refer to log-space reductions, by analogy with the complexity class L, but...

Large Space Telescope, the Hubble Space Telescope Living Systems Theory Log-space transducer, a type of Turing machine used for log-space reductions Löwenheim–Skolem...

randomized logarithmic space, which is not known to equal NL. Several problems are known to be NL-complete under log-space reductions, including ST-connectivity...

NP-complete under log space reductions. All currently known NP-complete problems remain NP-complete even under much weaker reductions such as A C 0 {\displaystyle...

to run (encoded in unary), is complete under log-space reduction for CC, the class of problems log-space reducible to the stable marriage problem. He...

Redox potential (also known as oxidation / reduction potential, ORP, pe, E r e d {\displaystyle E_{red}} , or E h {\displaystyle E_{h}} ) is a measure...

Redox (/ˈrɛdɒks/ RED-oks, /ˈriːdɒks/ REE-doks, reduction–oxidation or oxidation–reduction: 150 ) is a type of chemical reaction in which the oxidation...

then defined as the class of all problems with an L-reduction (linear reduction, not log-space reduction) to problems in MaxSNP0. For example, MAX-3SAT is...

based on resource bounds, such as polynomial-time reductions and log-space reductions. Reductions motivate the concept of a problem being hard for a...

In computer science, the reduction operator is a type of operator that is commonly used in parallel programming to reduce the elements of an array into...

theory of computation, he was among the pioneers of the study of Log-space reductions and P-completeness. Neil D. Jones was a Knight of the Order of the...

Comparison of PaX to Exec Shield and W^X Address Space Layout Randomization in Windows Vista - Michael Howard's Web Log ASLR for Windows 2000/XP/2003 (WehnTrust)...

specific criteria. Another example would be a log-linear model, obtaining a value at a point in m-D space as the product on appropriate marginal subspaces...

of Ω ( log ⁡ log ⁡ n ) , {\displaystyle \Omega (\log \log n),} upper bound of O ( 2 2 log ⁡ log ⁡ n ) . {\displaystyle O(2^{2{\sqrt {\log \log n}}}).}...

The Inflation Reduction Act of 2022 (IRA) is a United States federal law which aims to reduce the federal government budget deficit, lower prescription...

this space requirement. The idea is to define a reduction function R that maps hash values back into values in P. Note, however, that the reduction function...

{n \over b})} space. Because b = 1 2 log ⁡ n {\displaystyle b={1 \over 2}\log n} , O ( n b log ⁡ n b ) {\displaystyle O({n \over b}\log {n \over b})}...