Entry Belaga:1988:BMR from tcs1985.bib

Last update: Thu Sep 27 02:46:57 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Belaga:1988:BMR,
  author =       "Edward G. Belaga",
  title =        "Bilinear mincing rank",
  journal =      j-THEOR-COMP-SCI,
  volume =       "61",
  number =       "2--3",
  pages =        "299--306",
  month =        nov,
  year =         "1988",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "CNRS",
  affiliationaddress = "Strasbourg, Fr",
  classification = "921; C4240 (Programming and algorithm theory)",
  corpsource =   "IRMA-CNRS Univ. Louis Pasteur, Strasbourg, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "Bilinear Circuit-Size Complexity; bilinear
                 circuit-size complexity; bilinear form; Bilinear Form;
                 Bilinear Mincing Rank; bilinear mincing rank;
                 characteristic zero; computational complexity; lower
                 bound; Lower Bounds; Mathematical Techniques",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries