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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2017
010020019632017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We present a graph-based SLAM approach, using monocular vision and odometry, designed to operate on computationally constrained… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames. Therefore, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A spin 1/2 system on a honeycomb lattice is studied. The interactions between nearest neighbors are of XX, YY or ZZ type… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
An effective method for optimizing the performance of a fixed current distribution, uniformly spaced antenna array has been to… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Outer linearization methods, such as Van Slyke and Wets's L-shaped method for stochastic linear programs, generally apply a… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In our previous work we showed that genetic algorithms (GAs) provide a powerful tool to increase the accuracy of fuzzy models for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Fuzzy modeling of high-dimensional systems is a challenging topic. This paper proposes an effective approach to data-based fuzzy… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The previously best attack known on elliptic curve cryptosystems used in practice was the parallel collision search based on… (More)
Is this relevant?