Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Partial transmit sequences (PTS) is one of the attractive techniques to reduce the peak-to-average power ratio (PAPR) in… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A spin-1/2 system on a honeycomb lattice is studied. The interactions between nearest neighbors are of XX, YY or ZZ type… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper develops a method of estimating the coefficient of relative risk aversion (g) from data on labor supply. The main… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • Yaochu Jin
  • IEEE Trans. Fuzzy Syst.
  • 2000
  • Corpus ID: 17458136
Fuzzy modeling of high-dimensional systems is a challenging topic. This paper proposes an effective approach to data-based fuzzy… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Human population pressures upon land resources have increased the need to assess impacts of land use change on soil quality. In… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The success of 16 methods of phylogenetic inference was examined using consis? tency and simulation analysis. Success?the… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Traditional discrete-event simulations employ an inherently sequential algorithm. In practice, simulations of large systems are… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 4
Is this relevant?
Highly Cited
1978
Highly Cited
1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Therefore a necessary condition for a (1,l) form ( G I a ' r r ) I,,, Rlr dz' A d? to be the Ricci form of some Kahler metric is… Expand
Is this relevant?