989 search results - page 99 / 198 » Pebbling and Proofs of Work |
ITICSE
2010
ACM
13 years 10 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
CSR
2008
Springer
13 years 10 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
DAGSTUHL
2007
13 years 9 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
IICAI
2003
13 years 9 months ago
2003
Abstract. We present the Acyclic Bayesian Net Generator, a new approach to learn the structure of a Bayesian network using genetic algorithms. Due to the encoding mechanism, acycli...