Pages that link to "Item:Q3325058"

The following pages link to Succinct representations of graphs (Q3325058):

Displaying 43 items.

• Languages represented by Boolean formulas (Q290253) (← links)
• Succinct encoding of arbitrary graphs (Q391972) (← links)
• Model-checking hierarchical structures (Q414908) (← links)
• On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
• CNF and DNF succinct graph encodings (Q515682) (← links)
• Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
• Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
• On the succinct representation of graphs (Q800734) (← links)
• Trading uninitialized space for time (Q834884) (← links)
• On the complexity of kings (Q846367) (← links)
• Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
• Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
• The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
• On matroids and hierarchical graphs (Q1178207) (← links)
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
• Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
• Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
• Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
• Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
• Functions computable in polynomial space (Q1775891) (← links)
• Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
• A framework for analysing state-abstraction methods (Q2060741) (← links)
• The minimum oracle circuit size problem (Q2410683) (← links)
• Processing succinct matrices and vectors (Q2411035) (← links)
• The complexity of searching implicit graphs (Q2676567) (← links)
• Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
• Equality Testing of Compressed Strings (Q3449353) (← links)
• Specular Sets (Q3449371) (← links)
• Compressed Tree Canonization (Q3449487) (← links)
• The difference and truth-table hierarchies for NP (Q3783278) (← links)
• The computational complexity of graph problems with succinct multigraph representation (Q3801600) (← links)
• The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
• The complexity of searching succinctly represented graphs (Q4645179) (← links)
• A note on succinct representations of graphs (Q4725746) (← links)
• Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results (Q5026251) (← links)
• On matroids and hierarchical graphs (Q5056114) (← links)
• Sequential Relational Decomposition (Q5094122) (← links)
• Synthesis for Multi-weighted Games with Branching-Time Winning Conditions (Q5100749) (← links)
• A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
• Succinct Encodings of Graph Isomorphism (Q5404919) (← links)
• Representing graphs implicitly using almost optimal space (Q5928875) (← links)
• The complexity gap in the static analysis of cache accesses grows if procedure calls are added (Q6108428) (← links)
• Transformations of probability distributions (Q6615215) (← links)