Pages that link to "Item:Q514144"
From MaRDI portal
The following pages link to An initial study of time complexity in infinite-domain constraint satisfaction (Q514144):
Displaying 7 items.
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- (Q5005145) (← links)
- Deciding the consistency of branching time interval networks (Q5079779) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- (Q6060092) (← links)
- On prime scenarios in qualitative spatial and temporal reasoning (Q6614889) (← links)