In this paper, we solve a long-standing graph partition problem under vertex-compaction that has been of interest since about 1999. The graph partition problem that we consider in this paper is to decide whether or no...
详细信息
Limiting consideration to algorithms satisfying various numerical stability requirements may change lower bounds for computational complexity and/or make lower bounds easier to prove. We will show that, under a suffic...
详细信息
One of the stages of building of discrete models based on experimental data, is structural identification. Structural identification means the procedures of finding of general form of models. In cases if experimental ...
详细信息
It is well known that for many NP-complete problems, such as K-Sat, K-colorability etc., typical cases are easy to solve;so that coniputationally hard cases must be rare (assuming P # NP). This paper shows that NP-com...
详细信息
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton po...
详细信息
Usually, when speaking about dependence estimation in big sets of empirical data, it is adopted to suggest that the set of precedents does not fit in the memory of one computer, and some technology of distributed comp...
详细信息
We present a model of computation with ordinary differential equations (ODEs) which converge to attractors that are interpreted as the output of a computation. We introduce a measure of complexity for exponentially co...
详细信息
We present a model of computation with ordinary differential equations (ODEs) which converge to attractors that are interpreted as the output of a computation. We introduce a measure of complexity for exponentially convergent ODEs, enabling an algorithmic analysis of continuous time flows and their comparison with discrete algorithms. We define polynomial and logarithmic continuous time complexity classes and show that an ODE which solves the maximum network flow problem has polynomial time complexity. We also analyze a simple flow that solves the maximum problem in logarithmic time. We conjecture that a subclass of the continuous P is equivalent to the classical P.
Implementation complexity will have a dramatic influence in facilitating the deployment of the JPEG-2000 technology in consumer market products. This paper addresses the computational complexity evaluation of the new ...
详细信息
ISBN:
(纸本)0819437603
Implementation complexity will have a dramatic influence in facilitating the deployment of the JPEG-2000 technology in consumer market products. This paper addresses the computational complexity evaluation of the new standard's compression engine. A non-optimised C code implementation of JPEG-2000 is profiled at run time using an automatic profiling tool built in house. The computational complexity measurements generated by the profiler are presented and discussed in the paper. The comparison between JPEG-2000 and JPEG baseline computational complexity is also presented.
We consider the relationship between computational complexity and the laws of physics, and show that nonlinear generalizations of quantum mechanics allow for polynomial-time solution of NP-complete and #P problems. Wh...
详细信息
暂无评论