Conference ProceedingsOPEN ACCESS

Underapproximation for model-checking based on random cryptographic constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4590 LNCS 339-351
DOI: 10.1007/978-3-540-73368-3_39
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For two naturals m,n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 < k

Cite

CITATION STYLE

APA

Matsliah, A., & Strichman, O. (2007). Underapproximation for model-checking based on random cryptographic constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4590 LNCS, pp. 339–351). Springer Verlag. https://doi.org/10.1007/978-3-540-73368-3_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free