Re: Subset sum problem: probabilistic fast testing algorithm...
- From: Yao Ziyuan <yaoziyuan@xxxxxxxxx>
- Date: Tue, 02 Oct 2007 01:12:50 -0000
I retract this ...
On Oct 1, 4:27 am, Yao Ziyuan <yaoziy...@xxxxxxxxx> wrote:
An algorithm that determines if any subset sum is to 0 modulo a large
constant K (preferably a prime number) may be a good probabilistic
fast testing algorithm for the subset sum problem...
.
- Prev by Date: Re: Exploiting limitations of Turing machines in Turing tests?
- Next by Date: Re: maximum common subgraph
- Previous by thread: Re: Exploiting limitations of Turing machines in Turing tests?
- Next by thread: Re: maximum common subgraph
- Index(es):
