Pages that link to "Item:Q4158479"
From MaRDI portal
The following pages link to `` Strong '' NP-Completeness Results (Q4158479):
Displaying 7 items.
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Constructive complexity (Q1182305) (← links)
- FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization (Q1932035) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Controlling the losing probability in a monotone game (Q2489238) (← links)
