A computational proof of complexity of some restricted counting problems

From MaRDI portal
Revision as of 06:55, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:534558

DOI10.1016/J.TCS.2010.10.039zbMATH Open1216.68122OpenAlexW2099255094MaRDI QIDQ534558

Author name not available (Why is that?)

Publication date: 18 May 2011

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.039



zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.








This page was built for publication: A computational proof of complexity of some restricted counting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534558)

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:534558&oldid=12425136"
Powered by MediaWiki