Sciweavers

33 search results - page 5 / 7
» Unbiased Branches: An Open Problem
Sort
View
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 3 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
RP
2010
Springer
150views Control Systems» more  RP 2010»
13 years 6 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
IACR
2011
134views more  IACR 2011»
12 years 8 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
CEC
2007
IEEE
14 years 2 months ago
A Memetic Algorithm for test data generation of Object-Oriented software
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
Andrea Arcuri, Xin Yao
AI
2011
Springer
13 years 3 months ago
A unifying action calculus
Abstract McCarthy’s Situation Calculus is arguably the oldest special-purpose knowledge representation formalism, designed to axiomatize knowledge of actions and their effects. ...
Michael Thielscher