Pages that link to "Item:Q1062447"

The following pages link to New NP-hard and NP-complete polynomial and integer divisibility problems (Q1062447):

Displaying 17 items.

• Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
• Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
• Counting curves and their projections (Q677992) (← links)
• Tropical varieties for exponential sums (Q785323) (← links)
• Irreducibility of multivariate polynomials (Q1083191) (← links)
• Complete divisibility problems for slowly utilized oracles (Q1083192) (← links)
• Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
• Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
• Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces (Q1745633) (← links)
• Correction to: ``Tropical varieties for exponential sums'' (Q2049974) (← links)
• Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346) (← links)
• On the frontiers of polynomial computations in tropical geometry (Q2457404) (← links)
• Real roots of univariate polynomials and straight line programs (Q2466010) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Computing the torsion points of a variety defined by lacunary polynomials (Q2894522) (← links)
• Complexity aspects of a semi-infinite optimization problem† (Q5449018) (← links)
• Digital collections of examples in mathematical sciences (Q6086393) (← links)