3946 search results - page 32 / 790 » The computational complexity of choice sets |
116
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
146
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
116
click to vote
IICS
2001
Springer
15 years 9 months ago
2001
Springer
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...
142
click to vote
IPCV
2008
15 years 6 months ago
2008
The automatic compression strategy proposed by Gergel et al. is a near-optimal lossy compression scheme for a given collection of images whose interimage relationships are unknown...
141
click to vote
CORR
2012
Springer
14 years 7 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...