Pages that link to "Item:Q1368832"
From MaRDI portal
The following pages link to Computational complexity over the \(p\)-adic numbers (Q1368832):
Displaying 14 items.
- On invariance of degree for certain computations (Q876819) (← links)
- On the complexity of \(p\)-adic basic semi-algebraic sets (Q883331) (← links)
- Efficient \(p\)-adic cell decompositions for univariate polynomials (Q1578508) (← links)
- P\(\neq\) NC over the \(p\)-adic numbers (Q1869961) (← links)
- Exact \(p\)-adic computation in Magma (Q2229728) (← links)
- Relativizations of the P = NP problem over the complex number field (Q2575544) (← links)
- Efficient Computation of <i>p</i>-Adic Heights (Q3091958) (← links)
- On the complexity of a putative counterexample to the -adic Littlewood conjecture (Q3447684) (← links)
- (Q4531985) (← links)
- (Q4717952) (← links)
- (Q4737511) (← links)
- (Q5444792) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- Calculs sur les structures de langage dénombrable (Q5958306) (← links)
