Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,432,859 papers from all fields of science
Search
Sign In
Create Free Account
Reduction (complexity)
Known as:
Reduce (complexity)
, Reduction (computability)
, Complexity reduction
Expand
In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Approximation-preserving reduction
Block cipher
Complete (complexity)
Computability theory
Expand
Broader (1)
Structural complexity theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
The 3Rs in research: a contemporary approach to replacement, reduction and refinement.
J. Clark
2017
Corpus ID: 208549612
: First promulgated in 1959, the 3Rs of Replacement, Reduction and Refinement have evolved as fundamental principles underlying…
Expand
2009
2009
Semiconductor Double-Ring-Resonator-Coupled Tunable Laser for Wavelength Routing
T. Segawa
,
S. Matsuo
,
T. Kakitsuka
,
T. Sato
,
Y. Kondo
,
R. Takahashi
IEEE Journal of Quantum Electronics
2009
Corpus ID: 37129684
A monolithic widely tunable semiconductor laser based on a double-ring resonator is developed for use in a wavelength-routing…
Expand
Highly Cited
2008
Highly Cited
2008
A 1.5-MW Seven-Cell Series-Stacked Converter as an Active Power Filter and Regeneration Converter for a DC Traction Substation
P. H. Henning
,
H. D. Fuchs
,
Abraham D. le Roux
,
H. Mouton
IEEE transactions on power electronics
2008
Corpus ID: 7266496
A prototype 1.5 MW series-stacked converter system was built and installed at a dc traction substation. The converter inverts…
Expand
1996
1996
Wide causation : Mental causation, reduction and supervenience
S. Yablo
1996
Corpus ID: 171163722
Soulevant la question de l'influence du mental sur les evenements physiques dans le contexte de la resistance a l…
Expand
Highly Cited
1990
Highly Cited
1990
Efficient search procedures for selecting the optimum innovation in stochastic coders
Isabel Trancoso
,
B. Atal
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 35135824
The authors describe several procedures that simplify the search in stochastic coders, but do not put constraints on the…
Expand
Highly Cited
1988
Highly Cited
1988
Mechanism of gliotoxin action and factors mediating gliotoxin sensitivity
Richard W. Jones
,
J. G. Hancock
1988
Corpus ID: 54187466
Summary: Resistance to the low M r fungal epipolythiodiketopiperazine toxin, gliotoxin, varied threefold between the…
Expand
1977
1977
Effect of diflubenzuron on growth and carbohydrate hydrolases ofTribolium castaneum
I. Ishaaya
,
K. Ascher
Phytoparasitica
1977
Corpus ID: 42904490
The potency of diflubenzuron is much greater in inhibiting growth and development of 1st instar larvae ofTribolium castaneum than…
Expand
Highly Cited
1972
Highly Cited
1972
Generation of Single Picosecond and Subpicosecond Light Pulses
A. Penzkofer
,
D. Linde
,
A. Laubereau
,
W. Kaiser
1972
Corpus ID: 122607687
Picosecond light pulses passing through a saturable absorber show considerable pulse shortening. For instance, under special…
Expand
Highly Cited
1968
Highly Cited
1968
Glutamate Dehydrogenases of Thiobacillus novellus KINETIC PROPERTIES AND A POSSIBLE CONTROL MECHANISM
H. LéJohn
,
I. Suzuki
,
J. Wright
1968
Corpus ID: 33975388
Abstract Kinetic analyses were conducted on two glutamate dehydrogenases isolated from the facultative chemoautotroph…
Expand
Highly Cited
1967
Highly Cited
1967
A Model for the Identification of Bacteria
E. W. Rypka
,
W. E. Clapper
,
I. G. Bowen
,
R. Babb
1967
Corpus ID: 86540682
SUMMARY: Two methods are described for determining the shortest route to an identification. The methods are based upon the…
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