Entry Siegelmann:1994:ACN from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Siegelmann:1994:ACN,
  author =       "Hava T. Siegelmann and Eduardo D. Sontag",
  title =        "Analog computation via neural networks",
  journal =      j-THEOR-COMP-SCI,
  volume =       "131",
  number =       "2",
  pages =        "331--360",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:23 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=131&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=131&issue=2&aid=1576",
  acknowledgement = ack-nhfb,
  classification = "C1230D (Neural nets); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Math. and Comput. Sci., Bar-Ilan Univ.,
                 Ramat-gan, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; dynamical systems;
                 equivalent resources; exponential time; lower bound
                 constraints; neural nets; neural networks; polynomially
                 NP-hard problems",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries