Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
نویسندگان
چکیده
منابع مشابه
Complexity of Matrix Multiplication and Bilinear Problems
Algebraic complexity theory is the study of computation using algebraic models. One of the main achievements of this field has been the introduction of methods to prove lower bounds on the computational complexity, in algebraic models of computation, of concrete problems. Another major achievement has been the development of powerful techniques to construct fast algorithms for computational pro...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولOn the Complexity of Bilinear Forms∗
This paper provides some new lower and upper bounds on computing bilinear forms by arithmetic circuits. The complexity measures considered are circuit size, formula size and time-space trade-offs.
متن کاملThe Complexity of Simulation and Matrix Multiplication
Computing the simulation preorder of a given Kripke structure (i.e., a directed graph with n labeled vertices) has crucial applications in model checking of temporal logic. It amounts to solving a specific two-players reachability game, called simulation game. We offer the first conditional lower bounds for this problem, and we relate its complexity (for computation, verification, and certifica...
متن کاملOn the Bilinear Complexity of the Multiplication in Finite Fields
— The aim of this paper is to introduce the bilinear complexity of the multiplication in finite fields and to give a brief exposition of the recent results obtained in this part of algebraic complexity theory. In particular we present the new results obtained using the Chudnovsky-Chudnovsky algorithm and its generalizations. Résumé (Sur la complexité bilinéaire de la multiplication dans les cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1973
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0202013