Symmetric Complementation
From MaRDI portal
Publication:3769977
Recommendations
Cited in
(16)- Approximation in (poly-) logarithmic space
- Absorbing random walks and the NAE2SAT problem
- Complete problems for symmetric logspace involving free groups
- Optimal parallel randomized algorithms for sparse addition and identification
- Complement, complexity, and symmetric representation
- Frameworks for designing in-place graph algorithms
- A framework for in-place graph algorithms
- Depth-first search is inherently sequential
- Sublinear-space approximation algorithms for Max \(r\)-SAT
- The complexity of planarity testing
- Approximation in (Poly-) Logarithmic Space
- Symmetric variation
- Planarity testing in parallel
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- Expected parallel time and sequential space complexity of graph and digraph problems
- Planarity testing revisited
This page was built for publication: Symmetric Complementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769977)