The following pages link to On monadic NP vs monadic co-NP (Q1898480):
Displaying 33 items.
- One unary function says less than two in existential second order logic (Q286970) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Data exchange: semantics and query answering (Q555772) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- Local properties of query languages (Q1575140) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- On second-order generalized quantifiers and finite structures (Q1612478) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- On the expressiveness of \textsc{Lara}: a proposal for unifying linear and relational algebra (Q2084947) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture (Q2947167) (← links)
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers (Q2974792) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
