Pages that link to "Item:Q290253"
From MaRDI portal
The following pages link to Languages represented by Boolean formulas (Q290253):
Displaying 6 items.
- Model-checking hierarchical structures (Q414908) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- On the Structure of Solution-Graphs for Boolean Formulas (Q2947874) (← links)
