Journal article

Computing Binary Combinatorial Gray Codes via Exhaustive Search with SAT−Solvers

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Zinovik, I., Kroening, D., & Chebiryak, Y. (2015). Computing Binary Combinatorial Gray Codes via Exhaustive Search with SAT−Solvers. IEEE Transactions on Information Theory.

MLA Style

Zinovik, I, et al. “Computing Binary Combinatorial Gray Codes via Exhaustive Search with SAT−Solvers.” IEEE Transactions on Information Theory, 2015.

Chicago Style

Zinovik, I, D Kroening, and Y Chebiryak. 2015. “Computing Binary Combinatorial Gray Codes via Exhaustive Search with SAT−Solvers.” IEEE Transactions on Information Theory.
Print

Authors

+ Zinovik, I More by this author

Role:: Author

+ Kroening, D More by this author

Role:: Author

+ Chebiryak, Y More by this author

Role:: Author

Journal:: IEEE Transactions on Information Theory More from this journal

UUID:: uuid:f3532c45-a358-4bb9-b91d-bc7c2ea2d1a5
Local pid:: cs:695
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_f3532c45a3584bb9b91dbc7c2ea2d1a5

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP