Feasible arithmetic computations: Valiant's hypothesis

Journal of Symbolic Computation

Volumn 4, Issue 2, 1987, Pages 137-172

  von zur Gathen, Joachim ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001567736     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(87)80063-9     Document Type: Article

References (57)

1. The complexity of partial derivatives
2. On computing the determinant in small parallel time using a small number of processors
3. Mémoire sur un système de formules analytiques, et leur application à des considérations géométriques
4. An introduction to multilinear algebra and some applications
5. Structured vs
6. Fast parallel matrix and GCD computations
7. The parallel evaluation of general arithmetic expressions
8. Mémoire sur les foncfions qui ne peuvent obtenir que deux valeurs égales et de signes contraires par suite des transpositions op6r6es entre les variables qu'elles renferment
9. A note on the complexity of algebraic differentiation
10. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
11. The complexity of theorem proving procedures
12. Fast parallel matrix inversion algorithms
13. Very fast parallel matrix and polynomial arithmetic
14. A system for manipulating polynomials given by straight-line programs
15. Irreducibility of multivariate polynomials
16. Parallel arithmetic computations: a survey
17. Factoring sparse multivariate polynomials
18. Boolean circuits versus arithmetic circuits
19. Question 6001
20. Lower bounds for polynomials with algebraic coefficients
21. On the parallel evaluation of multivariate polynomials
22. Probabilistic algorithms for deciding equivalence of straight-line programs
23. On probabilistic time and space
24. The formula size of the determinant
25. Uniform closure properties of p-computable functions
26. Reducibility among combinatorial problems
27. New algorithms and lower bounds for the parallel evaluation of certain rational expressions and recurrences
28. The van der Waerden conjecture: two proofs in one year
29. On the relation between the determinant and the permanent
30. The equivalence problem for regular expressions with squaring requires exponential space
31. Efficient parallel evaluation of straight-line code
32. Permanents
33. On two problems in abstract algebra connected with Hornet's rule
34. New NP-hard and NP-complete polynomial and integer divisibility problems
35. Aufgabe 424
36. Logarithmic depth circuits for algebraic functions
37. A complexity theory based on Boolean algebra
38. Bereehnung un.d Programm
39. Die Berechnungskomplexität von elementarsymmetrisehen Funktionen und von Interpolationskoeffizienten, Numer
40. Vermeidung yon Divisionen
41. Polynomials with rational coefficients which are hard to compute
42. Algebraische Bereehnungskomplexität
43. The work of L.G. Valiant
44. Zu Aufgabe 424
45. Completeness classes in algebra
46. The complexity of computing the permanent
47. Reducibility by algebraic projections
48. Fast parallel computation of polynomials using few processors