1380 search results - page 65 / 276 » A General Polynomial Sieve |
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
TCS
2010
13 years 7 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
FCCM
2005
IEEE
14 years 2 months ago
2005
IEEE
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...