Pages that link to "Item:Q1187032"
From MaRDI portal
The following pages link to Polynomial time algorithms for sentences over number fields (Q1187032):
Displaying 9 items.
- A decision algorithm for linear sentences on a PFM (Q685065) (← links)
- Algorithms for sentences over integral domains (Q920964) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Polynomial-time presentations of algebraic number fields (Q1670714) (← links)
- Computational complexity of arithmetical sentences (Q1898469) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Fields of algebraic numbers computable in polynomial time. II (Q2145863) (← links)