In the last few days, a Denial of Service attack was launched on universities in Israel, leading the administrators of the Israel Academic network to block access to it from the global internet. Consequently, websites such as ECCC have been accessible only from within the Israeli and European academic networks.
It seems that this blocking was just removed, and we hope it will not be put back in the future.
Needless to say, deciding on such blocking is not in our control, but we do apologize for this disruption of service.
A Boolean-weighted graph is a finite graph whose edges carry DNF formulas over a common variable set. This paper studies two isomorphism problems on such graphs, distinguished by whether the per-edge condition requires the matched edge labels to be syntactically DNF-isomorphic (BWG-ISO) or syntactically DNF non-isomorphic (BWG-NI), each over a ... more >>>
We study shortest paths in directed graphs whose edge weights are of the form $$wt(e) = a_{e,1} \lambda_1 + a_{e,2} \lambda_2 + a_{e,3} \lambda_3 + \cdots + a_{e,d} \lambda_d + a_{e,d+1}.$$
Here, each $a_{e,i}\in\mathbb{R}$ is a fixed constant for each edge $e$, whereas each $\lambda_i$ is a shared variable ...
more >>>
A Matching Vector ($\mathbf{MV}$) family modulo a positive integer $m\ge 2$ is a
pair of ordered lists $U=(u_1,\ldots,u_K)$ and $V=(v_1,\ldots,v_K)$ with
$u_i,v_j\in \Z_m^n$ such that $\langle u_i,v_i\rangle=0 \pmod m$ for every
$i\in[K]$, while $\langle u_i,v_j\rangle\ne 0 \pmod m$ for every $i\ne j$. It
is called $r$-restricted if the set of ...
more >>>
