Pages that link to "Item:Q1426470"
From MaRDI portal
The following pages link to Learnability of quantified formulas. (Q1426470):
Displaying 7 items.
- The expressive rate of constraints (Q812391) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Varieties with few subalgebras of powers (Q3550542) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
