Jump to content

Existing user? Sign In
Sign In

Remember me Not recommended on shared computers

Forgot your password?

Or sign in with one of these services
Sign Up

Browse
- Forums
- Events
- Guidelines
- Staff
- Online Users
- Leaderboard
- More
Activity
- All Activity
- Search
- More
Leaderboard
More
- More

Home

selcuk

Members

View Profile See their activity

Posts
2
Joined
December 17, 2011
Last visited
December 23, 2011

Profile Information

Favorite Area of Science
Logic

selcuk's Achievements

Lepton

Lepton (1/13)

0

Reputation

The Sat Problem is NP-complete!!!!!

selcuk replied to selcuk's topic in Computer Science

Thank you very much, i know that cook theorem very important but i dont understand this proof:( i need a illumunating sketchy! <br class="Apple-interchange-newline">
- December 23, 2011
- 3 replies
The Sat Problem is NP-complete!!!!!

selcuk posted a topic in Computer Science

Hello, I cant understand how to proof cook's theorem. Especially, i cant undertand proof on book of Computers and Intractability. Please help me about how to understand simply this proof. best regards...
- December 17, 2011
- 3 replies

×

Browse
- Back
- Forums
- Events
- Guidelines
- Staff
- Online Users
- Leaderboard
Activity
- Back
- All Activity
- Search
Leaderboard

×

Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.