Pages that link to "Item:Q3455548"
From MaRDI portal
The following pages link to Cosmological lower bound on the circuit complexity of a small problem in logic (Q3455548):
Displaying 9 items.
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry (Q322535) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Verification of agent navigation in partially-known environments (Q2144175) (← links)
- A note on dimensions of polynomial size circuits (Q2503295) (← links)
- (Q5094125) (← links)
- On algebraic array theories (Q6192058) (← links)
- Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)
- Succinctness of cosafety fragments of LTL via combinatorial proof systems (Q6629519) (← links)