Back to Results
First PageMeta Content
Search algorithms / Cryptographic hash functions / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / PP / Algorithm / Hash function / Universal hashing / Theoretical computer science / Applied mathematics / Computational complexity theory


A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 2
Add to Reading List

Document Date: 2013-07-17 18:10:56

Open Document

File Size: 580,96 KB

Share Result on Facebook

Company

Sigma Solutions Inc. / Sun Microsystems / Intel / /

Country

India / /

Currency

pence / /

Facility

Rice University / Indian Institute of Technology Bombay / /

IndustryTerm

hardware systems / industrial systems / formalverification tools / possible solutions / logic networks / verification applications / related algorithms / scaling advantage to our algorithm / /

Organization

Rice University / National Science Foundation / Board of Research / India Department of Computer Science / Indian Institute of Technology Bombay / US Federal Reserve / /

Person

Gomes / /

Position

Prime Minister / /

Product

CryptoMiniSAT / /

Technology

adapted algorithm / Preliminaries Our algorithm / BGP algorithm / The BGP algorithm / 3 Related Algorithms / UniWit algorithm / simulation / XORSample0 algorithm / closely related algorithms / two algorithms / /

SocialTag