-
1
-
-
0017983865
-
Binary decision diagrams
-
S. B. Akers. Binary Decision Diagrams. IEEE Transaction on Computers, 27(6):509-516, 1978.
-
(1978)
IEEE Transaction on Computers
, vol.27
, Issue.6
, pp. 509-516
-
-
Akers, S.B.1
-
2
-
-
0000710299
-
Queries and concept learning
-
D. Angluin. Queries and Concept Learning. Machine Learning, 2:319-342, 1988.
-
(1988)
Machine Learning
, vol.2
, pp. 319-342
-
-
Angluin, D.1
-
4
-
-
0002962651
-
Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
-
M. Blum, A. Chandra, and M. Wegman. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Information Processing Letters, 10:80-82, 1980.
-
(1980)
Information Processing Letters
, vol.10
, pp. 80-82
-
-
Blum, M.1
Chandra, A.2
Wegman, M.3
-
5
-
-
0026913667
-
Symbolic boolean manipulation with ordered binary-decision diagrams
-
R. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
-
(1992)
ACM Computing Surveys
, vol.24
, Issue.3
, pp. 293-318
-
-
Bryant, R.1
-
7
-
-
85000701062
-
The complexity of equivalence and containment for free single variable program schemes
-
S. Fortune, J. Hopcroft, and E. Schmidt. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. Lecture Notes in Computer Science: Automata, Languages Programming, 62:227-240, 1978.
-
(1978)
Lecture Notes in Computer Science: Automata, Languages Programming
, vol.62
, pp. 227-240
-
-
Fortune, S.1
Hopcroft, J.2
Schmidt, E.3
-
8
-
-
85009398482
-
Analysis and manipulation of Boolean functions in terms of decision graphs
-
LNCS, Springer-Verlag, Berlin
-
J. Gergov and C. Meinel. Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. Graph-Theoretic Concepts in Computer Science. LNCS, volume 657, pages 310-320. Springer-Verlag, Berlin, 1992.
-
(1992)
Graph-Theoretic Concepts in Computer Science
, vol.657
, pp. 310-320
-
-
Gergov, J.1
Meinel, C.2
-
9
-
-
0012948013
-
Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
-
LNCS, Springer-Verlag, Berlin
-
J. Gergov and C. Meinel. Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs. STACS '93. LNCS, volume 665, pages 576-585. Springer-Verlag, Berlin, 1993.
-
(1993)
STACS '93
, vol.665
, pp. 576-585
-
-
Gergov, J.1
Meinel, C.2
-
11
-
-
84903828974
-
Representation of switching circuits by binary-decision programs
-
C. Y. Lee. Representation of Switching Circuits by Binary-Decision Programs. Bell System Technical Journal, 38(4):985-999, 1959.
-
(1959)
Bell System Technical Journal
, vol.38
, Issue.4
, pp. 985-999
-
-
Lee, C.Y.1
-
12
-
-
0010764806
-
Modified branching programs and their computational power
-
Springer-Verlag, Berlin
-
C. Meinel. Modified Branching Programs and Their Computational Power. LNCS, volume 370. Springer-Verlag, Berlin, 1989.
-
(1989)
LNCS
, vol.370
-
-
Meinel, C.1
-
15
-
-
0003237296
-
Data structures and network algorithms
-
Philadelphia, PA
-
R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.
-
(1983)
SIAM
-
-
Tarjan, R.E.1
|