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)

Related topics

Related topics

50 relations
Approximation-preserving reductionBlock cipherComplete (complexity)Computability theory

Broader (1)

Structural complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
On the Use of NURBS Functions for Displacement Derivatives Measurement by Digital Image Correlation
In this paper, we propose to investigate the potential improvement of using Non-Uniform Rational B-Spline (NURBS) functions for… 
Highly Cited
2007
Highly Cited
2007
A Fast Mode Decision Algorithm and Its VLSI Design for H.264/AVC Intra-Prediction
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
A Pattern Learning Approach to Question Answering Within the Ephyra Framework
This paper describes the Ephyra question answering engine, a modular and extensible framework that allows to integrate multiple… 
Highly Cited
2004
Highly Cited
2004
Design and analysis of planar monopole antennas using a genetic algorithm approach
The application of genetic algorithm (GA) optimization to the design and analysis of planar monopole antennas is presented. GA is… 
Highly Cited
2004
Highly Cited
2004
‘Mobile Termination Charges: Calling Party Pays versus Receiving Party Pays’(original and revised versions)
Highly Cited
2002
Highly Cited
2002
DS-LFSR: a BIST TPG for low switching activity
A test pattern generator (TPG) for built-in self-test (BIST), which can reduce switching activity during test application, is… 
Highly Cited
2002
Highly Cited
2002
Introduction: Recent Developments in Parallel and Distributed Data Mining
Introduction Data Mining and Knowledge Discovery in Databases (KDD) is an interdisciplinary field merging ideas from statistics… 
Review
1997
Review
1997
The Generalized War of Attrition Forthcoming, American Econonomic Review
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
1996
Highly Cited
1996
Post global routing crosstalk risk estimation and reduction
Previous approaches for crosstalk synthesis often fail to achieve satisfactory results due to limited routing flexibility… 
Highly Cited
1996
Highly Cited
1996
FleetManager: a microcomputer-based decision support system for vehicle routing
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)