Pages that link to "Item:Q1854449"
From MaRDI portal
The following pages link to Bounded queries, approximations, and the Boolean hierarchy (Q1854449):
Displaying 9 items.
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- On the computational complexity of querying bounds on differences constraints (Q1855216) (← links)
- A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
- On the convergence of query-bounded computations and logical closure properties of c.e. sets (Q4328820) (← links)
- On Bounded Queries and Approximation (Q4337440) (← links)
- (Q4938554) (← links)
- (Q4945240) (← links)
- First-order queries on structures of bounded degree are computable with constant delay (Q5277786) (← links)