Entry Grigoriev:1996:CAC from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Grigoriev:1996:CAC,
  author =       "Dima Grigoriev and Marek Karpinski",
  title =        "Computability of the additive complexity of algebraic
                 circuits with root extracting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "157",
  number =       "1",
  pages =        "91--99",
  day =          "09",
  month =        apr,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:50 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=157&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=157&issue=1&aid=2118",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240C (Computational
                 complexity)",
  conflocation = "Paris, France; 6-7 June 1994",
  conftitle =    "Workshop on Algorithmic Complexity of Algebraic and
                 Geometric Models",
  corpsource =   "Dept. of Math., Pennsylvania State Univ., University
                 Park, PA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "additive complexity; algebraic circuits;
                 computability; computational complexity; root
                 extracting",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries