### Table 1. Coding of ternary elements

1999

Cited by 3

### TABLE II TERNARY MATCH CONDITIONS.

2002

### Table 1: Near Unity Approximants

"... In PAGE 4: ... As an example with 8-bit exponents, consider the generation of a sequence of successive values of possible 1-digit MDLNS (2-integer) values. Table1 shows a small subset of values (around unity) obtained from such a sequence. The fourth and fifth columns show the difference between successive binary and ternary exponents within the sequence.... ..."

### Table 1: Near Unity Approximants

"... In PAGE 4: ... As an example with 8-bit exponents, consider the generation of a sequence of successive values of possible 1-digit MDLNS (2-integer) values. Table1 shows a small subset of values (around unity) obtained from such a sequence. The fourth and fifth columns show the difference between successive binary and ternary exponents within the sequence.... ..."

### Table 5. Percentage of ternary+ operation count

2005

"... In PAGE 7: ... This shows that there is still some room for improvement. To put these results, obtained for the ternary and higher terms only, in proper perspec- tive, Table5 shows the percentage of the total computational cost due to the ternary and higher terms as a function of the V=O ratio. It is seen that the ternary+ cost is a sizable fraction of the overall calculation for lower V=O ratios, but it can rapidly become a rather small fraction of the overall cost if V=O is large, in particular for CCSDT.... ..."

Cited by 1

### Table 5. Percentage of ternary+ operation count

2005

"... In PAGE 7: ... This shows that there is still some room for improvement. To put these results, obtained for the ternary and higher terms only, in proper perspec- tive, Table5 shows the percentage of the total computational cost due to the ternary and higher terms as a function of the V=O ratio. It is seen that the ternary+ cost is a sizable fraction of the overall calculation for lower V=O ratios, but it can rapidly become a rather small fraction of the overall cost if V=O is large, in particular for CCSDT.... ..."

Cited by 1

### Table 1. 2-bit encoding of ternary logic

in Verification of Pipelined Microprocessors by Correspondence Checking in Symbolic Ternary Simulation

1998

"... In PAGE 4: ...ave a high encoding c.h and a low encoding c.l, each of which is a Boolean expression. The ternary values that can be represented by a control expression c are shown in Table1 .... ..."

Cited by 4

### Table 4. The number of the resulting ternary vectors

2000

"... In PAGE 8: ... In case of ordering by the number of strokes and ones in the TVL, our new block building algorithm shows the best performance. The number of resulting vectors is not constant for the four different algorithms (see Table4 ). The result depends on the starting position in the list of ternary vectors and on the direction of comparison.... ..."

Cited by 3

### Table 2.1: The intersection in ternary logic.

1994

Cited by 4