1998 search results - page 47 / 400 » Complexity of the Cover Polynomial |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
DLT
2009
13 years 7 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
SAS
2005
Springer
14 years 3 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
INDOCRYPT
2003
Springer
14 years 3 months ago
2003
Springer
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
IJCAI
2001
13 years 11 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...