
PreviousNext
This paper introduces a new model of computation for describing the
complexity of NP-approximation problems. The results show that the
complexity of NP-approximation problems can be characterized by classes of
multi-valued functions computed by nondeterministic polynomial time Turing
machines with a bounded number of oracle queries to an NP-complete
language. ...
more >>>
In this paper we first give a uniform $AC^0$ algorithm which uses
partial sums to compute multiple addition. Then we use it to show
that multiple addition is computable in uniform $TC^0$ by using
$count$ only once sequentially. By constructing bit matrix for
multiple addition, ...
more >>>
In this paper we investigate the parametrized
complexity of the problems MaxSat and MaxCut using the
framework developed by Downey and Fellows.
Let $G$ be an arbitrary graph having $n$ vertices and $m$
edges, and let $f$ be an arbitrary CNF formula with $m$
clauses on $n$ variables. We improve ...
more >>>
PreviousNext