155 search results - page 10 / 31 » Bounded Arithmetic and Descriptive Complexity |
DLOG
2003
13 years 8 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
AAAI
2006
13 years 8 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
RC
2002
13 years 7 months ago
2002
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
ISAAC
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...