Prev: Hey Adamk and Bacle, I found your mom's C-HOLE! (I be here all ze week...!)
Next: CRYPT32.DLL _CryptVerifyCertificateSignatureEx@32 _CryptMsgVerifyCountersignatureEncodedEx@40 _CryptEncodeObject@20 _CryptDecodeObject@28 _CryptEncodeObjectEx@28 _CryptDecodeObjectEx@32 _CryptFormatObject@36 _CryptQueryObject@44 _CryptInitOIDFunct
From: Thorsten Kiefer on 18 Apr 2010 09:31
Hi,
I wrote an applet, with wich you can solve a SaT instance by hand.
It is based on multiplication, and maybe you can find a sequence of
multiplications, where the maximum number of minterms becomes minimal.

http://tokis-edv-service.de/index.php/beispiele/solving-sat-by-hand

Best Regards
Thorsten
 | 
Pages: 1
Prev: Hey Adamk and Bacle, I found your mom's C-HOLE! (I be here all ze week...!)
Next: CRYPT32.DLL _CryptVerifyCertificateSignatureEx@32 _CryptMsgVerifyCountersignatureEncodedEx@40 _CryptEncodeObject@20 _CryptDecodeObject@28 _CryptEncodeObjectEx@28 _CryptDecodeObjectEx@32 _CryptFormatObject@36 _CryptQueryObject@44 _CryptInitOIDFunct