Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,565,631 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
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
2009
Highly Cited
2009
Unit disk graph and physical interference model: Putting pieces together
E. Lebhar
,
Zvi Lotker
IEEE International Symposium on Parallel…
2009
Corpus ID: 15472530
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which…
Expand
Highly Cited
2007
Highly Cited
2007
Bounds for the capacity of wireless multihop networks imposed by topology and demand
A. Keshavarz-Haddad
,
R. Riedi
ACM Interational Symposium on Mobile Ad Hoc…
2007
Corpus ID: 15653736
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The…
Expand
Highly Cited
2004
Highly Cited
2004
A generalized time domain multipath channel and its application in ultra-wideband (UWB) wireless optimal receiver design-Part II: physics-based system analysis
R. Qiu
IEEE Transactions on Wireless Communications
2004
Corpus ID: 36149222
This paper has established a new theoretical framework that allows us to analyze the ultra-wideband system performance using the…
Expand
Highly Cited
2002
Highly Cited
2002
Budgeted learning of nailve-bayes classifiers
D. Lizotte
,
Omid Madani
,
R. Greiner
Conference on Uncertainty in Artificial…
2002
Corpus ID: 57387967
There is almost always a cost associated with acquiring training data. We consider the situation where the learner, with a fixed…
Expand
2001
2001
Fuzzy Logic Techniques in Multimedia Database Querying: A Preliminary Investigation of the Potentials
D. Dubois
,
H. Prade
,
F. Sèdes
IEEE Transactions on Knowledge and Data…
2001
Corpus ID: 789842
Fuzzy logic is known for providing a convenient tool for interfacing linguistic categories with numerical data and for expressing…
Expand
Highly Cited
1998
Highly Cited
1998
A linear matrix inequality approach to decentralized control of distributed parameter systems
R. D’Andrea
Proceedings of the American Control Conference…
1998
Corpus ID: 7153735
In this paper preliminary results in the use of linear matrix inequalities for the decentralized control of distributed parameter…
Expand
1989
1989
Variable-rate coding for meteor-burst communications
M. Pursley
,
S. Sandberg
IEEE Transactions on Communications
1989
Corpus ID: 42656757
The performance of variable-rate Reed-Solomon error-control coding for meteor-burst communications is considered. The code rate…
Expand
Highly Cited
1988
Highly Cited
1988
Analytic formulation and quantitative solutions of the coupled ULf wave problem
Xiaoming Zhu
,
M. Kivelson
1988
Corpus ID: 55008683
In the terrestrial magnetosphere, the inhomogeneous magnetic field and plasma density give rise to a continuous spectrum of field…
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
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