Skip to search formSkip to main contentSkip to account menu

Generic-case complexity

Known as: Generic case complexity 
Generic-case complexity is a subfield of computational complexity theory that studies the complexity of computational problems on "most inputs… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
2016
2016
We give a signed generalization of Laurent's theorem that characterizes feasible positive semidefinite matrix completion problems… 
2015
2015
The qualitative notion that ignition processes have similar behavior, even over an extensive range of starting conditions, is… 
2014
2014
This paper establishes the geometric structure of the lines of principal curvature of a hypersurface immersed in ${\mathbb R}^4… 
Review
2011
Review
2011
This note gives an informal overview of the proof in our paper "Borel Conjecture and Dual Borel Conjecture", see arXiv:1105.0823. 
2011
2011
Accurate determination of values of resonant frequencies and vibration characteristics of railway motor stators is an important… 
2010
2010
Terms rewriting systems (TRS) has an important modeling role in many aspects of computing systems. However, there is a need for… 
2009
2009
We present two metrics for airspace complexity, specifically measuring interactions of aircraft flows coming from multiple… 
2008
2008
Haplotype inference is an important and computationally challenging problem in genetics. A well-known approach to haplotype… 
1997
1997
With the emergence of distributed computing and the increasing trend towards the reuse of geographic data, a new generation of…