Timeline for The Examiner's Problem (uniform generation of SAT decision instances/answers)

11 events

when toggle format	what		by	license	comment
Jul 1, 2014 at 14:29	history	edited	usul	CC BY-SA 3.0	The comment to the answer explains it
May 2, 2013 at 3:09	vote	accept	usul
May 2, 2013 at 0:35	answer	added	Kaveh		timeline score: 4
May 1, 2013 at 22:39	comment	added	Kaveh		As Emanuele points out this is probably not what you are really looking for, you probably want to generate instance-solution pairs where solving the instance is "hard". Possibly related to what you are looking for: 1. David's answer here and 2. section 6 of Stephen A. Cook and David G. Mitchell, "Finding Hard Instances of the Satisfiability Problem: A Survey", 1997
May 1, 2013 at 21:55	history	edited	usul	CC BY-SA 3.0	added 189 characters in body
May 1, 2013 at 18:02	comment	added	usul		@TysonWilliams: Yes, I've edited the wording slightly to try to make that clear. Your statement should be, I think, equivalent to mine!
May 1, 2013 at 17:59	history	edited	usul	CC BY-SA 3.0	added 2 characters in body
May 1, 2013 at 15:24	answer	added	Manu		timeline score: 12
May 1, 2013 at 13:46	comment	added	Tyson Williams		Let me make sure I have the quantifiers correct. Are you asking if "for all $M$, there exists an $M'$, such that $M'$ can efficiently solve the the output of $M$" is true?
May 1, 2013 at 7:59	history	tweeted			twitter.com/#!/StackCSTheory/status/329505463286763521
May 1, 2013 at 6:52	history	asked	usul	CC BY-SA 3.0