Sciweavers

TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 5 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
CP
2009
Springer
14 years 5 months ago
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms
A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. ...
Carlos Ansótegui, Kevin Tierney, Meinolf Se...
DAC
2003
ACM
14 years 5 months ago
Learning from BDDs in SAT-based bounded model checking
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...