Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
The Data Driven Design Optimization Methodology (DDDOM) is a Dynamic Data Driven Application System (DDDAS) developed for engineering design optimization. The DDDOM synergizes expe...
: Constructing a certification path is the mainly method of validating a certificate at given time. The established path will consist of all the valid certificates that reside betw...