Pages that link to "Item:Q1853564"
From MaRDI portal
The following pages link to MAX3SAT is exponentially hard to approximate if NP has positive dimension. (Q1853564):
Displaying 8 items.
- The size of SPP (Q596117) (← links)
- Pushdown dimension (Q995564) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Dimension is compression (Q1946504) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
- Many-valued logics and holographic proofs (Q4938652) (← links)
- Approximating Succinct MaxSat (Q5696308) (← links)