Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. Fournier, H., Malod, G., & Mengel, S. Computational Complexity, 24(1):1–30, 2015. Paper doi bibtex @article{DBLP:journals/cc/FournierMM15,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Stefan Mengel},
title = {Monomials in Arithmetic Circuits: Complete Problems in the Counting
Hierarchy},
journal = {Computational Complexity},
volume = {24},
number = {1},
pages = {1--30},
year = {2015},
url = {https://doi.org/10.1007/s00037-013-0079-3},
doi = {10.1007/s00037-013-0079-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/bib/journals/cc/FournierMM15},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"q2joi96ZQdHXuTrSu","bibbaseid":"fournier-malod-mengel-monomialsinarithmeticcircuitscompleteproblemsinthecountinghierarchy-2015","downloads":0,"creationDate":"2018-09-04T15:19:08.016Z","title":"Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy","author_short":["Fournier, H.","Malod, G.","Mengel, S."],"year":2015,"bibtype":"article","biburl":"https://dblp.org/pers/tb2/m/Mengel:Stefan.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Hervé"],"propositions":[],"lastnames":["Fournier"],"suffixes":[]},{"firstnames":["Guillaume"],"propositions":[],"lastnames":["Malod"],"suffixes":[]},{"firstnames":["Stefan"],"propositions":[],"lastnames":["Mengel"],"suffixes":[]}],"title":"Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy","journal":"Computational Complexity","volume":"24","number":"1","pages":"1–30","year":"2015","url":"https://doi.org/10.1007/s00037-013-0079-3","doi":"10.1007/s00037-013-0079-3","timestamp":"Sun, 28 May 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/cc/FournierMM15","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/cc/FournierMM15,\n author = {Herv{\\'{e}} Fournier and\n Guillaume Malod and\n Stefan Mengel},\n title = {Monomials in Arithmetic Circuits: Complete Problems in the Counting\n Hierarchy},\n journal = {Computational Complexity},\n volume = {24},\n number = {1},\n pages = {1--30},\n year = {2015},\n url = {https://doi.org/10.1007/s00037-013-0079-3},\n doi = {10.1007/s00037-013-0079-3},\n timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/cc/FournierMM15},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fournier, H.","Malod, G.","Mengel, S."],"key":"DBLP:journals/cc/FournierMM15","id":"DBLP:journals/cc/FournierMM15","bibbaseid":"fournier-malod-mengel-monomialsinarithmeticcircuitscompleteproblemsinthecountinghierarchy-2015","role":"author","urls":{"Paper":"https://doi.org/10.1007/s00037-013-0079-3"},"downloads":0},"search_terms":["monomials","arithmetic","circuits","complete","problems","counting","hierarchy","fournier","malod","mengel"],"keywords":[],"authorIDs":[],"dataSources":["CsDvMEzAnTqurnAbX"]}