Skip to search formSkip to main contentSkip to account menu

First-order reduction

Known as: First-order 
In computer science, a first-order reduction is a very weak type of reduction between two computational problems in computational complexity theory… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
ABSTRACTWe propose approximate ray-tracing equations for qP-waves propagating in smooth, inhomogeneous, weakly anisotropic media… 
2002
2002
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires… 
Highly Cited
1999
Highly Cited
1999
Recent results have shown how to construct the smoothed transmission properties of a plane fault from the parameters of its… 
1998
1998
The efficiency of speculative markets, as represented by Fama's 1970 fair game model, is tested on weekly price index data of six… 
Highly Cited
1997
Highly Cited
1997
  • Kemin LiHui Liu
  • 1997
  • Corpus ID: 5160323
This paper addresses the problem of CDMA multiuser detection in the presence of unknown multipath channels and residual carriers… 
Highly Cited
1988
Highly Cited
1988
SummaryThe influence of the water regime on mineralization and immobilization of N and P was investigated in a calcareous sandy… 
Highly Cited
1987
Highly Cited
1987
Eilenberger's quasiclassical equations are solved numerically, for the first time without approximations, for a hexagonal vortex… 
Highly Cited
1977
Highly Cited
1977
A high-temperature series expansion for the Edwards and Anderson spin-glass order-parameter susceptibility is computed for Ising… 
Highly Cited
1975
Highly Cited
1975
Following the Galerkin projective technique, first-order triangular finite elements are derived for the nonlinear diffusion…