Re: complexity of numerical software(2)
- From: Richard Fateman <fateman@xxxxxxxxxxxxxxx>
- Date: Fri, 09 Dec 2005 17:10:27 GMT
Jaap Spies wrote:
???I don't know where this enumeration problem came up, but in my view it is not "numerical software" in the sense of "numerical analysis". Combinatory enumeration has its interesting aspects, but to say, based on this example, that numerical software is easy (or hard) doesn't seem convincing. RJf
Do something to proces alle n-subsets of a m-set.
> problem(int n, int m) > { > int i, j;
RJF .
- Follow-Ups:
- Re: complexity of numerical software(2)
- From: Jaap Spies
- Re: complexity of numerical software(2)
- References:
- complexity of numerical software(2)
- From: Jaap Spies
- complexity of numerical software(2)
- Prev by Date: Re: complexity of numerical software
- Next by Date: Re: Symbolic Math as Computer Science
- Previous by thread: complexity of numerical software(2)
- Next by thread: Re: complexity of numerical software(2)
- Index(es):
Relevant Pages
|
Loading