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.
2016
2016
  • B. JacksonA. Nixon
  • 2016
  • Corpus ID: 119334295
2010
2010
. Let R be any ergodic, countable generic equivalence relation on a perfect Polish space X. It follows from the main theorem of… 
2010
2010
This paper presents a new approach for generic protocol configuration in agents' internal models. Generic protocols are reusable… 
2006
2006
Refactoring is about changing the design of existing code without changing its behaviour, but with the aim of making code easier… 
Highly Cited
2005
Highly Cited
2005
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem… 
Review
2004
Review
2004
This paper discusses the sensitivity of ac coil contactors to voltage sags, short interruptions, and undervoltage transients on… 
Highly Cited
2003
Highly Cited
2003
Abstract.This paper details a visual-concept-ontology-driven knowledge acquisition methodology. We propose to use a visual… 
1998
1998
With the advent of distributed computing and the increasing trend towards the reuse of geographical data, a new generation of…