Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
This paper studies a general class of formations of unicycle robots. One of the robots plays the role of the leader and the formation is induced through a constraint function F tha...
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
We consider a polymerization (fragmentation) model with size-dependent parameters involved in prion proliferation. Using power laws for the different rates of this model, we reco...
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...