1696 search results - page 34 / 340 » Permuted function matching |
TCC
2010
Springer
15 years 6 months ago
2010
Springer
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
COMBINATORICS
2006
14 years 10 months ago
2006
In this paper, we study Grothendieck polynomials indexed by Grassmannian permutations from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials which are...
COMBINATORICS
2007
14 years 10 months ago
2007
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
FLOPS
2004
Springer
15 years 3 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
101
click to vote
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...