Pages that link to "Item:Q4725746"
From MaRDI portal
The following pages link to A note on succinct representations of graphs (Q4725746):
Displaying 31 items.
- Languages represented by Boolean formulas (Q290253) (← links)
- On regular realizability problems (Q375967) (← 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)
- Trading uninitialized space for time (Q834884) (← links)
- Approximating schedules for dynamic process graphs efficiently (Q876729) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Why not negation by fixpoint? (Q1176286) (← 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)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- On the Structure of Solution-Graphs for Boolean Formulas (Q2947874) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- The computational complexity of graph problems with succinct multigraph representation (Q3801600) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- On matroids and hierarchical graphs (Q5056114) (← links)
- On the Complexity of Value Iteration (Q5091264) (← links)
- Sequential Relational Decomposition (Q5094122) (← 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)
- Conversational recommendation: theoretical model and complexity analysis (Q6125269) (← links)
