Standard

AND–decomposition of boolean polynomials with prescribed shared variables. / Emelyanov, Pavel.

Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings. Vol. 9602 Springer-Verlag GmbH and Co. KG, 2016. p. 164-175 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9602).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Emelyanov, P 2016, AND–decomposition of boolean polynomials with prescribed shared variables. in Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings. vol. 9602, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9602, Springer-Verlag GmbH and Co. KG, pp. 164-175, 2nd International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016, Thiruvananthapuram, India, 17.02.2016. https://doi.org/10.1007/978-3-319-29221-2_14

APA

Emelyanov, P. (2016). AND–decomposition of boolean polynomials with prescribed shared variables. In Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings (Vol. 9602, pp. 164-175). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9602). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-319-29221-2_14

Vancouver

Emelyanov P. AND–decomposition of boolean polynomials with prescribed shared variables. In Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings. Vol. 9602. Springer-Verlag GmbH and Co. KG. 2016. p. 164-175. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-29221-2_14

Author

Emelyanov, Pavel. / AND–decomposition of boolean polynomials with prescribed shared variables. Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings. Vol. 9602 Springer-Verlag GmbH and Co. KG, 2016. pp. 164-175 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{cf189822989a41c0be940e8b7756e903,
title = "AND–decomposition of boolean polynomials with prescribed shared variables",
abstract = "In this article, we present an algorithm for conjunctive bi–decomposition of boolean polynomials where decomposition components share only prescribed variables. It is based on the polynomial–time algorithm of disjoint decomposition developed before. Some examples and evaluation of the algorithm are given.",
keywords = "AND–decomposition of boolean functions, Combinatorial optimization, Disjoint decomposition, Factoring polynomials over finite fields, Sharing prescribed variables between decomposition components",
author = "Pavel Emelyanov",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-29221-2_14",
language = "English",
isbn = "9783319292205",
volume = "9602",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "164--175",
booktitle = "Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings",
address = "Germany",
note = "2nd International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016 ; Conference date: 17-02-2016 Through 19-02-2016",

}

RIS

TY - GEN

T1 - AND–decomposition of boolean polynomials with prescribed shared variables

AU - Emelyanov, Pavel

PY - 2016/1/1

Y1 - 2016/1/1

N2 - In this article, we present an algorithm for conjunctive bi–decomposition of boolean polynomials where decomposition components share only prescribed variables. It is based on the polynomial–time algorithm of disjoint decomposition developed before. Some examples and evaluation of the algorithm are given.

AB - In this article, we present an algorithm for conjunctive bi–decomposition of boolean polynomials where decomposition components share only prescribed variables. It is based on the polynomial–time algorithm of disjoint decomposition developed before. Some examples and evaluation of the algorithm are given.

KW - AND–decomposition of boolean functions

KW - Combinatorial optimization

KW - Disjoint decomposition

KW - Factoring polynomials over finite fields

KW - Sharing prescribed variables between decomposition components

UR - http://www.scopus.com/inward/record.url?scp=84959168471&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-29221-2_14

DO - 10.1007/978-3-319-29221-2_14

M3 - Conference contribution

AN - SCOPUS:84959168471

SN - 9783319292205

VL - 9602

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 164

EP - 175

BT - Algorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings

PB - Springer-Verlag GmbH and Co. KG

T2 - 2nd International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016

Y2 - 17 February 2016 through 19 February 2016

ER -

ID: 14280201