Can Be Computed Recursively Using the Definitions of

Abstract

be computed recursively using the denitions of wp(o j ; C) where o j is an operation belonging to the set object, and C is either f alse or C is of the form (inset; outset). Thus, for a history h b of the set object, the computation of wp str for com(h b) has time complexity that is linear in the number of operations in com(h b). Thus, since Theorem 2… (More)

Topics

2 Figures and Tables

Slides referencing similar topics