The following pages link to (Q4694758):
Displaying 16 items.
- Languages represented by Boolean formulas (Q290253) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- On the succinct representation of graphs (Q800734) (← links)
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- A bound for the complexity of a simple graph (Q1102975) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- (Q3341898) (← links)
- A note on succinct representations of graphs (Q4725746) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)