Skip to search formSkip to main contentSkip to account menu

Hardness of approximation

Known as: Inapproximability 
In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Many studies have demonstrated that Enterococcus faecalis (E. faecalis) is the most important species responsible for persistent… 
2013
2013
Rice husk ash (RHA) is an agrowaste byproduct resulting from the incineration of rice husks for power production; white RHA is… 
2011
2011
Fe72B14.4Si9.6Nb4 metallic glass particles and pure Fe particles were separately dispersed into the pure aluminum by the friction… 
Highly Cited
2006
Highly Cited
2006
Dilute Al-0.06 at.% Sc alloys with microalloying additions of 50 at. ppm of ytterbium (Yb) or gadolinium (Gd) are studied with 3D… 
2006
2006
Co, Ni, Pt, Al, P, Cu, Zn, Ge, Ag, In, Sb or Au including in Sn-Ag based lead free solders were evaluated to study if these… 
2004
2004
We study the 2-dimensional generalization of the classical Bin Packing problem: Given a collection of rectangles of specified… 
2003
2003
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (Ltl) formula… 
2002
2002
In order to verify its application for abrasion-resistant implant materials such as abutment in dental implants and artificial… 
1997
1997
Microstructural observations of damage around indentations in Ti{sub 3}SiC{sub 2} are presented. The Vickers hardness decreased…