-
1
-
-
85059770931
-
The complexity of theorem proving procedures
-
S. Cook. The complexity of theorem proving procedures. In S. ACM Symposium on Theory of Computing, pages 151-158, 1971.
-
(1971)
S. ACM Symposium on Theory of Computing
, pp. 151-158
-
-
Cook, S.1
-
2
-
-
30344450270
-
An extensible SAT solver
-
SAT 2003, of
-
N. Eén and N. Sörensson. An extensible SAT solver. In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004.
-
(2004)
LNCS
, vol.2919
, pp. 502-518
-
-
Eén, N.1
Sörensson, N.2
-
3
-
-
34748876694
-
Exact toffoli network synthesis of reversible logic using boolean satisfiability
-
D. Große, X. Chen, and R. Drechsler. Exact toffoli network synthesis of reversible logic using boolean satisfiability. In IEEE Dallas/CAS Workshop, pages 51-54, 2006.
-
(2006)
IEEE Dallas/CAS Workshop
, pp. 51-54
-
-
Große, D.1
Chen, X.2
Drechsler, R.3
-
4
-
-
33750588847
-
An algorithm for synthesis of reversible logic circuits
-
P. Gupta, A. Agrawal, and N. Jha. An algorithm for synthesis of reversible logic circuits. IEEE Trans. on CAD of Integrated Circuits and Systems, 25(11):2317-2330, 2006.
-
(2006)
IEEE Trans. on CAD of Integrated Circuits and Systems
, vol.25
, Issue.11
, pp. 2317-2330
-
-
Gupta, P.1
Agrawal, A.2
Jha, N.3
-
5
-
-
33748112109
-
Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis
-
W. Hung, X. Song, G. Yang, J. Yang, and M. Perkowski. Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. on CAD of Integrated Circuits and Systems, 25(9):1652-1663, 2006.
-
(2006)
IEEE Trans. on CAD of Integrated Circuits and Systems
, vol.25
, Issue.9
, pp. 1652-1663
-
-
Hung, W.1
Song, X.2
Yang, G.3
Yang, J.4
Perkowski, M.5
-
6
-
-
0026623575
-
Test pattern generation using Boolean satisfiability
-
T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4-15, 1992.
-
(1992)
IEEE Trans. on CAD
, vol.11
, pp. 4-15
-
-
Larrabee, T.1
-
9
-
-
20444459774
-
Toffoli network synthesis with templates
-
D. Maslov, G. W. Dueck, and D. M. Miller. Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems, 24(6):807-817, 2005.
-
(2005)
IEEE Trans. on CAD of Integrated Circuits and Systems
, vol.24
, Issue.6
, pp. 807-817
-
-
Maslov, D.1
Dueck, G.W.2
Miller, D.M.3
-
11
-
-
0043136670
-
A transformation based algorithm for reversible logic synthesis
-
D. M. Miller, D. Maslov, and G. W. Dueck. A transformation based algorithm for reversible logic synthesis. In Design Automation Conf., pages 318-323, 2003.
-
(2003)
Design Automation Conf
, pp. 318-323
-
-
Miller, D.M.1
Maslov, D.2
Dueck, G.W.3
-
13
-
-
0036907069
-
-
V. Shende, A. Prasad, I. Markov, and J. Hayes. Reversible logic circuit synthesis. In Int'l Conf. on CAD, pages pp. 353-360, 2002.
-
V. Shende, A. Prasad, I. Markov, and J. Hayes. Reversible logic circuit synthesis. In Int'l Conf. on CAD, pages pp. 353-360, 2002.
-
-
-
-
14
-
-
84978092325
-
-
T. Toffoli. Reversible computing. In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer, 1980. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
-
T. Toffoli. Reversible computing. In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer, 1980. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
-
-
-
|