The following pages link to (Q4142699):
Displaying 18 items.
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Linear-space best-first search (Q685539) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Riemann's hypothesis and tests for primality (Q1235011) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Mind the gap: a study of tube tour (Q1761218) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization (Q1932035) (← links)
- How to whack moles (Q2503357) (← links)
- Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals (Q2765599) (← links)
