Pages that link to "Item:Q1822500"
From MaRDI portal
The following pages link to Bandwidth contrained NP-complete problems (Q1822500):
Displaying 12 items.
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas (Q1262855) (← links)
- Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines (Q1323339) (← links)
- On problems with short certificates (Q1338895) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
- (Q2986008) (← links)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359) (← links)