A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
With presumptions that e-government theories prevail in various formats and concepts around the globe, nations and institutions, not many examples are there to emulate in terms of...
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...