A secure programming environment must offer protection mechanisms for regulating the interaction between mutually suspicious code units. Discretionary Capability Confinement (DCC) is a static type system recently proposed for expressing and enforcing access control policies in Java programs. This paper considers the computational complexity of the type reconstruction problem for DCC, that is, t...

In this article we discuss the design of result veriication algorithms for optimization problems. In particular, we design time-optimal result veriication algorithms which verify the solution of all-pairs shortest paths, maximum-ow in a network, and matching problems. We prove that polynomial-time veriication algorithms for NP-complete problems do not exist exist, unless P = NP. Result veriicat...

Over recent years, the research of attribute reduction for general decision systems and, in particular, consistent tables has attracted great attention from computer science community due to emerge big data. It been known that, a table, we can derive polynomial time complexity algorithm finding reduct. In addition, redundant properties also be done time. However, all reduct sets table is proble...

The set cover problem is a classical question in combinatorics, computer science and complexity theory. It is one of Karp’s 21 NP-complete problems shown to be NP-complete in 1972. Several algorithms have been proposed to solve this problem, based on genetic algorithms (GA), Particle Swarm Optimizer (PSO) and in recent years algorithms based in behavior algorithms based groups or herds of anima...

Probabilistic computing with p-bits is a powerful, unique paradigm alternative to classical and holds experimental advantages over certain forms of quantum computing. Stochastic nanodevices have been experimentally demonstrated act as artificial neurons in solving problems through probabilistic Still, many open questions about the breadth size soluble remain. We demonstrate capability made stoc...