Constraints

13 August 2010

P not equal to NP (P ≠ NP) consequences

Filed under: Commentary,Question — András Salamon @ 20:43
Tags:

During the discussion about Vinay Deolalikar’s manuscript, many people commented about the consequences that would follow if we knew that P ≠ NP. I’d like to discuss these consequences in a little more detail.
(more…)

Advertisements

15 April 2010

k-ISOLATED SAT

Filed under: Commentary,Question — András Salamon @ 13:29
Tags:

How fast can one decide if a SAT instance has an isolated solution? (more…)

23 March 2010

Immediate SAT restarts?

Filed under: Commentary,Question — András Salamon @ 20:28
Tags:

SAT solvers have been moving to more frequent restarts. Can restarts completely replace local search? (more…)

10 February 2010

Is P=NP a reasonable hypothesis?

Filed under: Commentary,Question — András Salamon @ 13:00
Tags:

Does it even make sense to ask “what if P = NP?”, or is this nonsense? (more…)

P=NP consequences

Filed under: Question — András Salamon @ 1:30

The consequences of P = NP would be “potentially stunning”, according to Stephen Cook, in his Millennium Prize overview of the P versus NP problem.

Is this really true? (more…)

Create a free website or blog at WordPress.com.