Pages that link to "Item:Q1706155"
From MaRDI portal
The following pages link to On the computational complexity of problems related to distinguishability sets (Q1706155):
Displaying 5 items.
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- On propositional coding techniques for the distinguishability of objects in finite sets (Q2272883) (← links)
- (Q4038696) (← links)
- Error bounds for conditional algorithms in restricted complexity set membership identification (Q4507009) (← links)