The following pages link to Computing LOGCFL certificates (Q5958329):
Displaying 12 items.
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Fast parallel hypertree decompositions in logarithmic recursion depth (Q6536399) (← links)