Pages that link to "Item:Q1185244"

The following pages link to The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244):

Displaying 19 items.

• Languages represented by Boolean formulas (Q290253) (← links)
• Model-checking hierarchical structures (Q414908) (← links)
• The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
• Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
• Hierarchically specified unit disk graphs (Q1269904) (← links)
• Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
• The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
• Bounded MSC communication (Q1881218) (← links)
• A framework for analysing state-abstraction methods (Q2060741) (← links)
• Processing succinct matrices and vectors (Q2411035) (← links)
• Fixpoint logics over hierarchical structures (Q2429724) (← links)
• The complexity of searching implicit graphs (Q2676567) (← links)
• Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
• Program Repair for Hyperproperties (Q3297603) (← links)
• Compressed Tree Canonization (Q3449487) (← links)
• On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
• The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
• The complexity of searching succinctly represented graphs (Q4645179) (← links)
• A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)