Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
We show that the block principal pivot algorithm (BPPA) for the linear complementarity problem (LCP) solves the problem for a special class of matrices in at most n block principal pivot steps. We provide cycling examples for the BPPA in which the matrix is positive definite or symmetric positive definite. For LCP of order three, we prove that strict column (row) diagonal dominance is a sufficient condition to avoid cycling. © 1997 Elsevier Science B.V.
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Eric Price, David P. Woodruff
FOCS 2011
Elliot Linzer, M. Vetterli
Computing
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory