13603 search results - page 110 / 2721 » On the Computational Complexity of Cut-Reduction |
185
Voted
COCO
1995
Springer
15 years 9 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
119
click to vote
AIPS
2008
15 years 8 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
148
click to vote
DLT
2008
15 years 7 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
130
click to vote
NIPS
2000
15 years 7 months ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
171
click to vote
EMMCVPR
2009
Springer
15 years 10 months ago
2009
Springer
Complex diffusion was introduced in the image processing literature as a means to achieve simultaneous denoising and enhancement of scalar valued images. In this paper, we present ...