Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,613,926 papers from all fields of science
Search
Sign In
Create Free Account
Cobham's thesis
Known as:
Tractable
, Cobham–Edmonds thesis
, Cobham-Edmonds thesis
Expand
Cobham's thesis, also known as Cobham–Edmonds thesis (named after Alan Cobham and Jack Edmonds), asserts that computational problems can be feasibly…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Analysis of algorithms
Complexity class
Computational complexity theory
Jack Edmonds
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Electricity price modeling and asset valuation: a multi-fuel structural approach
R. Carmona
,
Michael Coulon
,
D. Schwarz
2012
Corpus ID: 14568265
We introduce a new and highly tractable structural model for spot and derivative prices in electricity markets. Using a…
Expand
Highly Cited
2012
Highly Cited
2012
Multiuser MIMO Relay Networks in Nakagami-m Fading Channels
Nan Yang
,
M. Elkashlan
,
Phee Lep Yeoh
,
Jinhong Yuan
IEEE Transactions on Communications
2012
Corpus ID: 783331
This paper proposes a low complexity protocol that preserves full diversity in multiuser amplify-and-forward relay networks with…
Expand
Highly Cited
2006
Highly Cited
2006
Improving the Scalability of Semi-Markov Conditional Random Fields for Named Entity Recognition
Daisuke Okanohara
,
Yusuke Miyao
,
Yoshimasa Tsuruoka
,
Junichi Tsujii
Annual Meeting of the Association for…
2006
Corpus ID: 12618817
This paper presents techniques to apply semi-CRFs to Named Entity Recognition tasks with a tractable computational cost. Our…
Expand
Highly Cited
2001
Highly Cited
2001
Traffic modeling and characterization for UMTS networks
Alexander Klemm
,
C. Lindemann
,
Marco Lohmann
GLOBECOM'01. IEEE Global Telecommunications…
2001
Corpus ID: 2752699
In this paper, we present a synthetic traffic model for the Universal Mobile Telecommunication Systems (UMTS) based on measured…
Expand
Highly Cited
2000
Highly Cited
2000
On a decomposition of multivariable forms via LMI methods
P. Parrilo
Proceedings of the American Control Conference…
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…
Expand
Highly Cited
1999
Highly Cited
1999
Processing of (in)tractable polymers using reactive solvents Part 5: morphology control during phase separation
B. Jansen
,
H. H. Meijer
,
Pj Piet Lemstra
1999
Corpus ID: 59571963
Highly Cited
1996
Highly Cited
1996
Models and Algorithms for Distribution Problems with Uncertain Demands
R. Cheung
,
Warrren B Powell
Transportation Science
1996
Corpus ID: 8678856
We consider the problem of distributing goods from one or more plants through a set of warehouses in anticipation of forecasted…
Expand
Highly Cited
1994
Highly Cited
1994
Sometimes "Tomorrow" is "Sometime" - Action Refinement in a Temporal Logic of Objects
J. Fiadeiro
,
Tom Maibaum
International Conference on Temporal Logic
1994
Corpus ID: 15414700
We address the hierarchical (vertical) decomposition, or abstract implementation, of object specification in temporal logic…
Expand
Highly Cited
1987
Highly Cited
1987
A Formalism and Environment for the Development of a Large Grammar of English
Ted Briscoe
,
Claire Grover
,
B. Boguraev
,
John A. Carroll
International Joint Conference on Artificial…
1987
Corpus ID: 14287805
Natural language grammars with large coverage are typically the result of many person-years of effort, working with clumsy…
Expand
Highly Cited
1971
Highly Cited
1971
An Evaluator for the Number of Operationally Ready Aircraft in a Multilevel Supply System
C. C. Sherbrooke
Operational Research
1971
Corpus ID: 20397624
This paper develops an analytic model that evaluates the expected number of aircraft not operationally ready at a random point in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE