Skip to search formSkip to main contentSkip to account menu

Reduction (complexity)

Known as: Reduce (complexity), Reduction (computability), Complexity reduction 
In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this paper, we propose to investigate the potential improvement of using Non-Uniform Rational B-Spline (NURBS) functions for… 
Highly Cited
2008
Highly Cited
2008
A prototype 1.5 MW series-stacked converter system was built and installed at a dc traction substation. The converter inverts… 
Highly Cited
2007
Highly Cited
2007
In this paper, we present a fast mode decision algorithm and design its VLSI architecture for H.264 intra-prediction. A regular… 
Highly Cited
2006
Highly Cited
2006
The influence of electrolyte composition (pure sulphuric or perchloric acid and their mixtures) on the kinetics of the oxygen… 
Highly Cited
2003
Highly Cited
2003
A symmetry analysis of the cylindrical target implosion driven by a high-frequency rotating beam of heavy ions is presented. The… 
2002
2002
In this paper we deal with probabilistic inference in the most general form of coherent conditional probability assessments. In… 
Review
1997
Review
1997
We model a War of Attrition with N +K firms competing for N prizes. If firms must pay their full costs until the whole game ends… 
Highly Cited
1968
Highly Cited
1968
Abstract Kinetic analyses were conducted on two glutamate dehydrogenases isolated from the facultative chemoautotroph…