Bounded-depth, polynomial-size circuits for symmetric functions
Theoretical Computer Science
Definability by constant-depth polynomial-size circuits
Information and Control
A topological characterization of thinning
Theoretical Computer Science
Problems complete for deterministic logarithmic space
Journal of Algorithms
An EREW PRAM Algorithm for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Multidimensional digital boundaries
CVGIP: Graphical Models and Image Processing
Topology-preserving deformations of two-valued digital pictures
Graphical Models and Image Processing
Homotopy in two-dimensional digital images
Theoretical Computer Science
Topology preservation within digital surfaces
Graphical Models
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
Fast computation of the normal vector field of the surface of a 3-D discrete object
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Fast Estimation of Mean Curvature on the Surface of a 3D Discrete Object
DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
Do we need a stack to erase a component in a binary image?
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
| Hi-index | 5.23 |
We study the computational complexity of some well-known problems of 2D digital topology. We prove that all considered problems (including reachability in 2D binary images, connectivity, lower homotopy and symmetric homotopy) are in LogSpace. We prove that reachability in 2D binary images and some other problems are NC1-hard. Finally, we prove that most of the considered problems are not in AC0.