@article{DBLP:journals/amai/KasifBDS93,
  author       = {Simon Kasif and
                  Saibal Banerjee and
                  Arthur L. Delcher and
                  Gregory F. Sullivan},
  title        = {Some Results on the Computational Complexity of Symmetric Connectionist
                  Networks},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {9},
  number       = {3-4},
  pages        = {327--344},
  year         = {1993},
  url          = {https://doi.org/10.1007/BF01530937},
  doi          = {10.1007/BF01530937},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/KasifBDS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"LG9mghbnKYwbh5xHA","bibbaseid":"kasif-banerjee-delcher-sullivan-someresultsonthecomputationalcomplexityofsymmetricconnectionistnetworks-1993","authorIDs":[],"author_short":["Kasif, S.","Banerjee, S.","Delcher, A. L.","Sullivan, G. F."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Simon"],"propositions":[],"lastnames":["Kasif"],"suffixes":[]},{"firstnames":["Saibal"],"propositions":[],"lastnames":["Banerjee"],"suffixes":[]},{"firstnames":["Arthur","L."],"propositions":[],"lastnames":["Delcher"],"suffixes":[]},{"firstnames":["Gregory","F."],"propositions":[],"lastnames":["Sullivan"],"suffixes":[]}],"title":"Some Results on the Computational Complexity of Symmetric Connectionist Networks","journal":"Ann. Math. Artif. Intell.","volume":"9","number":"3-4","pages":"327–344","year":"1993","url":"https://doi.org/10.1007/BF01530937","doi":"10.1007/BF01530937","timestamp":"Sun, 28 May 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/amai/KasifBDS93.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/amai/KasifBDS93,\n author = {Simon Kasif and\n Saibal Banerjee and\n Arthur L. Delcher and\n Gregory F. Sullivan},\n title = {Some Results on the Computational Complexity of Symmetric Connectionist\n Networks},\n journal = {Ann. Math. Artif. Intell.},\n volume = {9},\n number = {3-4},\n pages = {327--344},\n year = {1993},\n url = {https://doi.org/10.1007/BF01530937},\n doi = {10.1007/BF01530937},\n timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/amai/KasifBDS93.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Kasif, S.","Banerjee, S.","Delcher, A. L.","Sullivan, G. F."],"key":"DBLP:journals/amai/KasifBDS93","id":"DBLP:journals/amai/KasifBDS93","bibbaseid":"kasif-banerjee-delcher-sullivan-someresultsonthecomputationalcomplexityofsymmetricconnectionistnetworks-1993","role":"author","urls":{"Paper":"https://doi.org/10.1007/BF01530937"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://dblp.org/pid/39/46.bib","creationDate":"2020-04-01T20:21:42.114Z","downloads":0,"keywords":[],"search_terms":["results","computational","complexity","symmetric","connectionist","networks","kasif","banerjee","delcher","sullivan"],"title":"Some Results on the Computational Complexity of Symmetric Connectionist Networks","year":1993,"dataSources":["m8fM6NFJB6YqwqqbS","d9wmsZxqeHRanAgze"]}