Pages that link to "Item:Q4778270"

The following pages link to Polynomials with Rational Coefficients Which are Hard to Compute (Q4778270):

Displaying 26 items.

• On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
• On commutativity and approximation (Q799369) (← links)
• Lower bounds in algebraic computational complexity (Q1057648) (← links)
• Irreducibility of multivariate polynomials (Q1083191) (← links)
• Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797) (← links)
• Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
• Some polynomials that are hard to compute (Q1143788) (← links)
• Lower bounds for polynomials with algebraic coefficients (Q1148670) (← links)
• On the additive complexity of polynomials (Q1157163) (← links)
• Complexity measures and hierarchies for the evaluation of integers and polynomials (Q1241288) (← links)
• Evaluation of polynomials with super-preconditioning (Q1243131) (← links)
• Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials (Q1249939) (← links)
• Simplified lower bounds for polynomials with algebraic coefficients (Q1361874) (← links)
• Lower bounds for some decision problems over \(C\) (Q1605321) (← links)
• On the representation of rational functions of bounded complexity (Q1822978) (← links)
• The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
• Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
• On sets of linear forms of maximal complexity (Q2680709) (← links)
• A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings (Q3872452) (← links)
• Derandomization from Algebraic Hardness (Q5073523) (← links)
• (Q5092471) (← links)
• A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
• Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)