Standard

Finding efficient circuits using SAT-solvers. / Kojevnikov, Arist; Kulikov, Alexander S.; Yaroslavtsev, Grigory.

Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings. 2009. стр. 32-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 5584 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Kojevnikov, A, Kulikov, AS & Yaroslavtsev, G 2009, Finding efficient circuits using SAT-solvers. в Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 5584 LNCS, стр. 32-44, 12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009, Swansea, Великобритания, 30/06/09. https://doi.org/10.1007/978-3-642-02777-2_5

APA

Kojevnikov, A., Kulikov, A. S., & Yaroslavtsev, G. (2009). Finding efficient circuits using SAT-solvers. в Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings (стр. 32-44). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 5584 LNCS). https://doi.org/10.1007/978-3-642-02777-2_5

Vancouver

Kojevnikov A, Kulikov AS, Yaroslavtsev G. Finding efficient circuits using SAT-solvers. в Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings. 2009. стр. 32-44. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02777-2_5

Author

Kojevnikov, Arist ; Kulikov, Alexander S. ; Yaroslavtsev, Grigory. / Finding efficient circuits using SAT-solvers. Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings. 2009. стр. 32-44 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{748ac3d923ca4466a3d639c6c91a7e7d,
title = "Finding efficient circuits using SAT-solvers",
abstract = "In this paper we report preliminary results of experiments with finding efficient circuits (over binary bases) using SAT-solvers. We present upper bounds for functions with constant number of inputs as well as general upper bounds that were found automatically. We focus mainly on MOD-functions. Besides theoretical interest, these functions are also interesting from a practical point of view as they are the core of the residue number system. In particular, we present a circuit of size 3n+c over the full binary basis computing MOD 3 n.",
author = "Arist Kojevnikov and Kulikov, {Alexander S.} and Grigory Yaroslavtsev",
year = "2009",
month = nov,
day = "9",
doi = "10.1007/978-3-642-02777-2_5",
language = "English",
isbn = "3642027768",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "32--44",
booktitle = "Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings",
note = "12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009 ; Conference date: 30-06-2009 Through 03-07-2009",

}

RIS

TY - GEN

T1 - Finding efficient circuits using SAT-solvers

AU - Kojevnikov, Arist

AU - Kulikov, Alexander S.

AU - Yaroslavtsev, Grigory

PY - 2009/11/9

Y1 - 2009/11/9

N2 - In this paper we report preliminary results of experiments with finding efficient circuits (over binary bases) using SAT-solvers. We present upper bounds for functions with constant number of inputs as well as general upper bounds that were found automatically. We focus mainly on MOD-functions. Besides theoretical interest, these functions are also interesting from a practical point of view as they are the core of the residue number system. In particular, we present a circuit of size 3n+c over the full binary basis computing MOD 3 n.

AB - In this paper we report preliminary results of experiments with finding efficient circuits (over binary bases) using SAT-solvers. We present upper bounds for functions with constant number of inputs as well as general upper bounds that were found automatically. We focus mainly on MOD-functions. Besides theoretical interest, these functions are also interesting from a practical point of view as they are the core of the residue number system. In particular, we present a circuit of size 3n+c over the full binary basis computing MOD 3 n.

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

U2 - 10.1007/978-3-642-02777-2_5

DO - 10.1007/978-3-642-02777-2_5

M3 - Conference contribution

AN - SCOPUS:70350635168

SN - 3642027768

SN - 9783642027765

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

SP - 32

EP - 44

BT - Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings

T2 - 12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009

Y2 - 30 June 2009 through 3 July 2009

ER -

ID: 49825371