File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-22685-4_7
- Scopus: eid_2-s2.0-80052003292
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint sum
Title | Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint sum |
---|---|
Authors | |
Keywords | Arithmetic circuit Counting problems Parameterized problems Polynomial factor Polynomial space |
Issue Date | 2011 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 17th Annual International Computing and Combinatorics Conference (COCOON'11), Dallas, TX., 14-16 August 2011. In Lecture Notes in Computer Science, 2011, v. 6842, p. 74-85 How to Cite? |
Abstract | We present new algorithms for exact multilinear k-monomial counting which is to compute the sum of coefficients of all degree-k multilinear monomials in a given polynomial P over a ring R described by an arithmetic circuit C. If the polynomial can be represented as a product of two polynomials with degree at most d< k, our algorithm can solve this problem in ... |
Description | LNCS v. 6842 has title: Computing and combinatorics: proceedings of the 17th Annual International Conference, COCOON 2011 |
Persistent Identifier | http://hdl.handle.net/10722/152004 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, D | en_US |
dc.contributor.author | Wang, Y | en_US |
dc.contributor.author | Hua, Q | en_US |
dc.contributor.author | Lau, FCM | en_US |
dc.date.accessioned | 2012-06-26T06:32:20Z | - |
dc.date.available | 2012-06-26T06:32:20Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.citation | The 17th Annual International Computing and Combinatorics Conference (COCOON'11), Dallas, TX., 14-16 August 2011. In Lecture Notes in Computer Science, 2011, v. 6842, p. 74-85 | en_US |
dc.identifier.isbn | 9783642226847 | - |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/152004 | - |
dc.description | LNCS v. 6842 has title: Computing and combinatorics: proceedings of the 17th Annual International Conference, COCOON 2011 | - |
dc.description.abstract | We present new algorithms for exact multilinear k-monomial counting which is to compute the sum of coefficients of all degree-k multilinear monomials in a given polynomial P over a ring R described by an arithmetic circuit C. If the polynomial can be represented as a product of two polynomials with degree at most d< k, our algorithm can solve this problem in ... | en_US |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Arithmetic circuit | - |
dc.subject | Counting problems | - |
dc.subject | Parameterized problems | - |
dc.subject | Polynomial factor | - |
dc.subject | Polynomial space | - |
dc.title | Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint sum | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Yu, D: dxyu@hku.hk | en_US |
dc.identifier.email | Hua, Q: huaqs@hku.hk | - |
dc.identifier.email | Lau, FCM: fcmlau@cs.hku.hk | - |
dc.identifier.authority | Lau, FCM=rp00221 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-22685-4_7 | en_US |
dc.identifier.scopus | eid_2-s2.0-80052003292 | en_US |
dc.identifier.hkuros | 211551 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-80052003292&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 6842 | en_US |
dc.identifier.spage | 74 | en_US |
dc.identifier.epage | 85 | en_US |
dc.publisher.place | Germany | en_US |
dc.description.other | The 17th Annual International Computing and Combinatorics Conference (COCOON'11), Dallas, TX., 14-16 August 2011. In Lecture Notes in Computer Science, 2011, v. 6842, p. 74-85 | - |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_US |
dc.identifier.scopusauthorid | Hua, QS=15060090400 | en_US |
dc.identifier.scopusauthorid | Wang, Y=35222735000 | en_US |
dc.identifier.scopusauthorid | Yu, D=30767911100 | en_US |
dc.identifier.issnl | 0302-9743 | - |