Finding Efficient Circuits for Ensemble Computation-Reference-Cited by-同舟云学术

Finding Efficient Circuits for Ensemble Computation

Published:2012 Issue: Volume: Page:369-382
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2012
language:
Short-container-title:

Author:

Järvisalo Matti,Kaski Petteri,Koivisto Mikko,Korhonen Janne H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31612-8_28.pdf

Reference21 articles.

1. Biere, A.: Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010. FMV Technical Report 10/1, Johannes Kepler University, Linz, Austria (2010)

2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M., Nederlof, J., Parviainen, P.: Fast zeta transforms for lattices with few irreducibles. In: Proc. SODA, pp. 1436–1444. SIAM (2012)

3. Lecture Notes in Computer Science;E. Dantsin,2010

4. Demenkov, E., Kojevnikov, A., Kulikov, A.S., Yaroslavtsev, G.: New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett. 110(7), 264–267 (2010)

5. Lecture Notes in Computer Science;N. Eén,2004

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Algorithms for the Ensemble Computation Problem;2022 7th International Conference on Intelligent Informatics and Biomedical Science (ICIIBMS);2022-11-24

2. Reducing Energy Consumption Using Genetic Improvement;Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation;2015-07-11

3. Evaluating Instance Generators by Configuration;Lecture Notes in Computer Science;2014

4. Synchronous Counting and Computational Algorithm Design;Lecture Notes in Computer Science;2013