The following pages link to Pf ≠ NPf for almost all f (Q4434508):
Displaying 6 items.
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- P ≠ NP ∩ co-NP for Infinite Time Turing Machines (Q3374094) (← links)
- <i>P</i> ≠ <i>NP</i> for all infinite Boolean algebras (Q4804182) (← links)
- \(\text{P}\neq \text{NP}\) for the reals with various analytic functions (Q5938579) (← links)
