Theory
in [Programming]
|
Sat solver game Hi, I turned my sat solver into a game : http://tokis-edv-service.de/index.php/beispiele/solving-sat-by-hand If you dont wanna register, simply use the guest account. password of guest is guest. Have much fun with it. Best wishes Thorsten ... 27 May 2010 19:16
// Window main # Window object called "main" // Window main # Window object called "main" // title "Main" # Initial value of attribute // width 600px # Initial value of attribute // /message (.*)/: # Pattern of a received message // status $1$. # Action: send message to status // /quit/: // self halt. // Label status // background #CCCCCC // /.*/: // se... 26 May 2010 22:27
come participate in or critique 3rd Static Analysis Tool Exposition (SATE) We are beginning the third Static Analysis Tool Exposition (SATE). Briefly, participating tool makers run their tool on a set of programs. Researchers led by NIST analyze the tool reports. The results and experiences are reported at a workshop. The tool reports and analysis are made publicly available later. The... 26 May 2010 15:48
Call for papers - AITC 2010 Advances in the Theory of Computing" (AITC'2010) is a special session of SYNASC 2010, the 12th Annual Symposium on Symbolic and Numeric Algorithms for Scientific Compting. Conference location: West University of Timisoara, Romania, September 26-29, 2010. AITC Website: http://tcs.ieat.ro/aitc2010 Program Com... 24 May 2010 11:13
Hey Dude Asst. over at Clay here is the second piece of what you asked me to mail if you follow sci.math This is the html version of the file http://www.cs.princeton.edu/~arora/talks/pcptalk.ppt. Executed and transcribed by M. M. Musatov and http://meami.org/ How NP got a new definition: Probabilistically Checkable Proofs (PCPs) & Approximation Properties of NP-hard problems SANJEEV ARORA PRINCETON UNI... 24 May 2010 07:56
"Book Smart" NP-Complete Method: Musatov is closing in... Gaining... People are starting to talk... "Book Smart" NP-Complete scenarios are often written out as complicated conditional dependent problems involving multiple sets or pieces of data, such as the NP-Complete Dean's List problem given by Cook. It is easy to incorrectly oversimplify. One strategy to avoid this mistake is write code in a two-step pro... 24 May 2010 07:56
Cougar Mercury Performance ######################################################################### ######### Cougar Mercury Performance VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV ######### FOUND IT HERE: #########http://free-infobase.net/sjuf/cougar-mercury-performance #####... 23 May 2010 14:39
Selfridges Company Information ######################################################################### ######### Selfridges Company Information VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV ######### FOUND IT HERE: #########http://free-infobase.net/sjuf/selfridges-company-information ... 23 May 2010 13:34
The P=NP problem solved! I have a very elegant proof that P = NP if and only if N = 1 or P = 0, but the margins of the Usenet are too narrow for me to write down this proof. Email me for details. ... 22 May 2010 19:17 |