Search found 7 matches
- Tue Mar 02, 2004 10:00 am
- Forum: Algorithms
- Topic: NP Complete
- Replies: 3
- Views: 1655
- Mon Mar 01, 2004 7:18 am
- Forum: Algorithms
- Topic: NP Complete
- Replies: 3
- Views: 1655
NP Complete
Hi all expert programmer,
I was trying to search some theory about "NP-Complete",but i could not.
May anyone give me some link about NP ?.Thanks very much.
I'm bad at English,sorry for me.
I was trying to search some theory about "NP-Complete",but i could not.
May anyone give me some link about NP ?.Thanks very much.
I'm bad at English,sorry for me.
- Thu Feb 26, 2004 11:53 am
- Forum: Algorithms
- Topic: Algorithm Books
- Replies: 19
- Views: 7850
- Wed Feb 11, 2004 9:38 am
- Forum: Algorithms
- Topic: Help me!
- Replies: 5
- Views: 3639
- Wed Feb 11, 2004 9:37 am
- Forum: Algorithms
- Topic: Help me!
- Replies: 5
- Views: 3639
- Tue Jan 20, 2004 4:57 pm
- Forum: Algorithms
- Topic: Help me!
- Replies: 5
- Views: 3639
Help me!
Can anyone solve this problem?
An arithmetic progression is a sequence of the form a, a+b, a+2b, ..., a+nb where n=0,1,2,3,... . For this problem, a is a non-negative integer and b is a positive integer.
Write a program that finds all arithmetic progressions of length n in the set S of bisquares ...
An arithmetic progression is a sequence of the form a, a+b, a+2b, ..., a+nb where n=0,1,2,3,... . For this problem, a is a non-negative integer and b is a positive integer.
Write a program that finds all arithmetic progressions of length n in the set S of bisquares ...
- Sat Dec 13, 2003 5:57 am
- Forum: Other words
- Topic: programming challenges
- Replies: 0
- Views: 720
programming challenges
Hi all,
Did any one have ebook whose title is "Programming Challenges"?
Would you like to give me that ebook?
http://www.amazon.com/exec/obidos/tg/de ... 1?v=glance
Thanks very much.
Sorry for my broken English.
Did any one have ebook whose title is "Programming Challenges"?
Would you like to give me that ebook?
http://www.amazon.com/exec/obidos/tg/de ... 1?v=glance
Thanks very much.
Sorry for my broken English.