Algebraic Complexity Theory | Zendy

Nicholas Pippenger | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Algebraic Complexity Theory

Author(s) -

Nicholas Pippenger

Publication year - 1981

Publication title -

ibm journal of research and development

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.47

H-Index - 95

eISSN - 2151-8556

pISSN - 0018-8646

DOI - 10.1147/rd.255.0825

Subject(s) - multiplication (music) , algebra over a field , algebraic theory , algebraic number , bilinear interpolation , mathematics , matrix multiplication , algebraic operation , computer science , polynomial , arithmetic , pure mathematics , combinatorics , mathematical analysis , statistics , physics , quantum mechanics , quantum

Algebraic complexity theory, the study of the minimum number of operations sufficient to perform algebraic computations, is surveyed with emphasis on the general theory of bilinear forms and two of its applications: polynomial multiplication and matrix multiplication. Though by no means exhausting algebraic complexity theory, these topics illustrate well its development and its methods, and provide examples of its most striking successes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research