Compact multilinear transformations
نویسندگان
چکیده
منابع مشابه
Compact Notation for Finite Transformations
We describe a new notation for finite transformations. This compact notation extends the orbit-cycle notation for permutations and builds upon existing notations. It gives insight into the structure of transformations and reduces the length of expressions without increasing the number of types of symbols.
متن کاملMultilinear-NC1 6= Multilinear-NC2
An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit example for a polynomial f(x1, ..., xn), with coefficients in {0, 1}, such that over any field: 1. f can be computed by a polynomial-size multilinear circuit of depth O(log n). 2. Any multilinear formula for f is of size nΩ(logn). This gives a super-polynomial gap ...
متن کاملSemiparametric estimation of rigid transformations on compact Lie groups
To cite this version: Bigot, Jérémie and Loubes, Jean-Michel and Vimond, Myriam Semiparametric estimation of shifts on compact Lie groups. (2008) In: 2nd MICCAI Workshop on Mathematical Foundations of Computational Anatomy, 6 September 2008 6 September 2008 (New York, United States). Open Archive Toulouse Archive Ouverte (OATAO) OATAO is an open access repository that collects the work of Toulo...
متن کاملSpaces with a Compact Lie Group of Transformations
Introduction. A topological group © is said to act on a topological space 1{ if the elements of © are homeomorphisms of 'R. onto itself and if the mapping (a{p) of ©X^ onto %_ is continuous. Familiar examples include the rotation group acting on the Cartesian plane and the Euclidean group acting on Euclidean space. The set ®(p) (that is, the set of all <r(p) where <r(E®) is called the o...
متن کاملGeneral Circuit Realizing Compact Revocable Attribute-Based Encryption from Multilinear Maps
This paper demonstrates new technique for managing revocation in the context of attribute-based encryption (ABE) and presents two selectively secure directly revocable ABE (RABE) constructions – supporting decryption policies realizable by polynomial size Boolean circuits of arbitrary fan-out and – featuring compactness in the sense that the number of revocation controlling components in cipher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1972
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1972-0295076-1