Sciweavers

28 search results - page 1 / 6
» On Enumeration of Polynomial Equivalence Classes and Their A...
Sort
View
IACR
2011
126views more  IACR 2011»
12 years 4 months ago
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
Dongdai Lin, Jean-Charles Faugère, Ludovic ...
JCT
2010
92views more  JCT 2010»
13 years 3 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
OOPSLA
2005
Springer
13 years 10 months ago
Refactoring support for class library migration
As object-oriented class libraries evolve, classes are occasionally deprecated in favor of others with roughly the same functionality. In Java’s standard libraries, for example,...
Ittai Balaban, Frank Tip, Robert M. Fuhrer
ALT
2011
Springer
12 years 4 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
COMPGEOM
1995
ACM
13 years 8 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner