Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CIE
2008
Springer

favoriteEmaildiscussreport

73views Applied Computing» more CIE 2008»

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time

13 years 6 months ago

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time

Download www2.mta.ac.il

Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen

Real-time Traffic

Applied Computing | CIE 2008 |

claim paper

Related Content

» Soft Linear Logic and Polynomial Complexity Classes

» Exponential Time Complexity of the Permanent and the Tutte Polynomial

» In Search of an Easy Witness Exponential Time vs Probabilistic Polynomial Time

» Exact XML Type Checking in Polynomial Time

» Relative Loss Bounds and PolynomialTime Predictions for the klmsnet Algorithm

» Amortized Resource Analysis with Polynomial Potential A Static Inference of Polynomial Bo...

» Polynomial Linear Programming with Gaussian Belief Propagation

» XPath evaluation in linear time with polynomial combined complexity

» The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	CIE
Authors	Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen

Comments (0)