Let G = (V;E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication. Building on recent work of Aingworth, Chekuri and Motwani, we describe an ~ O(minfn3=2m1=2; n7=3g) time algorithmAPASP2 for computing all distances in G with an additive one-sided error...

In Bitcoin and Ethereum, nodes require a large storage capacity to maintain all of the blockchain data such as transactions. As September 2021, size has expanded 355 GB, it increased by approximately 50 GB every year over last five years. This requirement is major hurdle becoming block proposer or validator. We propose an architecture called Trail that allows hold blocks in small generate valid...

drawing up the insurance contracts by insurance companies has led to disregard policyholder's rights. this means that insurers by inserting unfair terms in insurance contracts seek to make a contract that they gain special privileges for themselves. jurists as main opponents of injustice regard commitment not to insert unfair terms as one of the insurer's pre-contractual obligations i...