dietzfelbinger造句

例句与造句

1. Nondeterministic communication complexity occurs as a means to obtaining lower bounds for deterministic communication complexity ( see Dietzfelbinger et al . ), but also in the theory of nonnegative matrices, where it gives a lower bound on the nonnegative rank of a nonnegative matrix.
2. By results due to Dietzfelbinger et al ., as long as the total number of insertions or deletions exceeds the number of elements at the time of last construction, the amortized expected cost of insertion and deletion remain O ( 1 ) with full rehashing taken into consideration.
3. Viewed differently, this amounts to covering all 1-entries of the 0 / 1-matrix by combinatorial 1-rectangles ( i . e ., non-contiguous, non-convex submatrices, whose entries are all one ( see Kushilevitz and Nisan or Dietzfelbinger et al . ) ).
4. Dietzfelbinger et al . present a dynamic dictionary algorithm that, when a set of n items is incrementally added to the dictionary, membership queries always run in constant time and therefore O ( 1 ) worst-case time, the total storage required is O ( n ) ( linear ), and O ( 1 ) expected amortized insertion and deletion time ( amortized constant time ).
5. It's difficult to find dietzfelbinger in a sentence. 用dietzfelbinger造句挺难的