993 search results - page 5 / 199 » The Complexity of Probabilistic EL |
JC
2006
13 years 7 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
SIAMCOMP
2008
13 years 7 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
COLT
2007
Springer
14 years 1 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
SEW
2006
IEEE
14 years 1 months ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...