| Definite integration and summation are #P-hard (1998) | |||||||||||||||||
Abstract | |||||||||||||||||
| Abstract — We show that the common symbolic manipulation tasks of computing multiple partial derivatives, definite integration, and definite summation, are #P-hard, i.e., at least as hard as counting the accepting input strings for any Turing machine that halts in polynomial time. (The “multiple partial derivatives ” part was previously known.) | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||