Details
| Original language | English |
|---|---|
| Journal | Log. Methods Comput. Sci. |
| Volume | 8 |
| Issue number | 3 |
| Publication status | Published - 2010 |
Keywords
- cs.CC, F.2.2
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems. / Böhler, Elmar; Creignou, Nadia; Galota, Matthias et al.
In: Log. Methods Comput. Sci., Vol. 8, No. 3, 2010.
In: Log. Methods Comput. Sci., Vol. 8, No. 3, 2010.
Research output: Contribution to journal › Article › Research › peer review
Böhler, E, Creignou, N, Galota, M, Reith, S, Schnoor, H & Vollmer, H 2010, 'Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems', Log. Methods Comput. Sci., vol. 8, no. 3. https://doi.org/10.2168/LMCS-8(3:31)2012, https://doi.org/10.2168/LMCS-8(3:27)2012
Böhler, E., Creignou, N., Galota, M., Reith, S., Schnoor, H., & Vollmer, H. (2010). Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems. Log. Methods Comput. Sci., 8(3). https://doi.org/10.2168/LMCS-8(3:31)2012, https://doi.org/10.2168/LMCS-8(3:27)2012
Böhler E, Creignou N, Galota M, Reith S, Schnoor H, Vollmer H. Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems. Log. Methods Comput. Sci. 2010;8(3). doi: 10.2168/LMCS-8(3:31)2012, 10.2168/LMCS-8(3:27)2012
Download
@article{b17f18880c4941b0ad5bfbac665d1fc6,
title = "Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems",
keywords = "cs.CC, F.2.2",
author = "Elmar B{\"o}hler and Nadia Creignou and Matthias Galota and Steffen Reith and Henning Schnoor and Heribert Vollmer",
note = "Funding information: Supported by the Agence Nationale de la Recherche under grant ANR-09-BLAN-0011-01. Supported by DFG VO 630/6-2.",
year = "2010",
doi = "10.2168/LMCS-8(3:31)2012",
language = "English",
volume = "8",
number = "3",
}
Download
TY - JOUR
T1 - Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems
AU - Böhler, Elmar
AU - Creignou, Nadia
AU - Galota, Matthias
AU - Reith, Steffen
AU - Schnoor, Henning
AU - Vollmer, Heribert
N1 - Funding information: Supported by the Agence Nationale de la Recherche under grant ANR-09-BLAN-0011-01. Supported by DFG VO 630/6-2.
PY - 2010
Y1 - 2010
KW - cs.CC
KW - F.2.2
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85011715889&partnerID=MN8TOARS
U2 - 10.2168/LMCS-8(3:31)2012
DO - 10.2168/LMCS-8(3:31)2012
M3 - Article
VL - 8
JO - Log. Methods Comput. Sci.
JF - Log. Methods Comput. Sci.
IS - 3
ER -