The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities,

Abstract

The lower bounds on the additive complexity of a bilinear problem are expressed in terms of the rank of the problem and also as a minimum number of elementary steps for the transformation of the identity matrix into a strongly regular one.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA112972

Entities

People

  • V. Ya. Pan

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • Algorithms
  • Arithmetic
  • Chemical Reactions
  • Coefficients
  • Computational Complexity
  • Computer Programming
  • Computer Science
  • Computers
  • Identities
  • Military Research
  • New Jersey
  • Polynomials
  • Universities

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Calculus or Mathematical Analysis