Skip to search formSkip to main contentSkip to account menu

Cobham's thesis

Known as: Tractable, Cobham–Edmonds thesis, Cobham-Edmonds thesis 
Cobham's thesis, also known as Cobham–Edmonds thesis (named after Alan Cobham and Jack Edmonds), asserts that computational problems can be feasibly… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We introduce a new and highly tractable structural model for spot and derivative prices in electricity markets. Using a… 
Highly Cited
2012
Highly Cited
2012
This paper proposes a low complexity protocol that preserves full diversity in multiuser amplify-and-forward relay networks with… 
Highly Cited
2006
Highly Cited
2006
This paper presents techniques to apply semi-CRFs to Named Entity Recognition tasks with a tractable computational cost. Our… 
Highly Cited
2001
Highly Cited
2001
In this paper, we present a synthetic traffic model for the Universal Mobile Telecommunication Systems (UMTS) based on measured… 
Highly Cited
2000
Highly Cited
2000
  • P. Parrilo
  • 2000
  • Corpus ID: 63205210
In this paper, it is shown that some of the convenient characteristics of LMI-based methods can be extended to a class of… 
Highly Cited
1996
Highly Cited
1996
We consider the problem of distributing goods from one or more plants through a set of warehouses in anticipation of forecasted… 
Highly Cited
1994
Highly Cited
1994
We address the hierarchical (vertical) decomposition, or abstract implementation, of object specification in temporal logic… 
Highly Cited
1987
Highly Cited
1987
Natural language grammars with large coverage are typically the result of many person-years of effort, working with clumsy… 
Highly Cited
1971
Highly Cited
1971
This paper develops an analytic model that evaluates the expected number of aircraft not operationally ready at a random point in…