The following pages link to Pascal Koiran (Q287066):
Displaying 50 items.
- (Q197783) (redirect page) (← links)
- Complexity and dimension (Q287068) (← links)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Interpolation in Valiant's theory (Q451113) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Lower bounds by Birkhoff interpolation (Q511113) (← links)
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- VPSPACE and a transfer theorem over the reals (Q626668) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- Neural networks with quadratic VC dimension (Q676433) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- On the construction of a family of transversal subspaces over finite fields (Q929484) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- VPSPACE and a transfer theorem over the complex field (Q1034531) (← links)
- Erratum: Elimination of constants from machines over algebraically closed fields (Q1265144) (← links)
- Vapnik-Chervonenkis dimension of recurrent neural networks (Q1265745) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- A polynomial time algorithm for diophantine equations in one variable (Q1284218) (← links)
- Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons (Q1319352) (← links)
- Computability with low-dimensional dynamical systems (Q1334658) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- A family of universal recurrent networks (Q1349875) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- Approximation and learning of convex superpositions (Q1370865) (← links)
- Vandermonde matrices, NP-completeness and transversal subspaces (Q1430506) (← links)
- Transfer theorems via sign conditions (Q1603522) (← links)
- On the linear independence of shifted powers (Q1704606) (← links)
- Valiant's model and the cost of computing integers (Q1766818) (← links)
- A rank theorem for Vandermonde matrices (Q1826719) (← links)
- Computing over the reals with addition and order: Higher complexity classes (Q1908895) (← links)
- On the complexity of the multivariate resultant (Q1939330) (← links)
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- Root separation for trinomials (Q2000267) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem (Q2256583) (← links)
- Reconstruction algorithms for sums of affine powers (Q2284961) (← links)
- Intersection multiplicity of a sparse curve and a low-degree curve (Q2301455) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- Hilbert's Nullstellensatz is in the polynomial hierarchy (Q2365408) (← links)
- The quantum query complexity of the abelian hidden subgroup problem (Q2373740) (← links)
- Quantum automata and algebraic groups (Q2456549) (← links)
- The complexity of two problems on arithmetic circuits (Q2465637) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- (Q2754200) (← links)
- (Q2768452) (← links)
- (Q2911618) (← links)
- Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
