Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
The problem of designing robust controller for discrete two-time-scale interval systems, conveniently represented using interval matrix notion, is considered. The original full ord...
Interval arithmetic is based on the fact that for intervals on the real line, the element-wise product of two intervals is also an interval. This property is not always true: e.g....