Sciweavers

725 search results - page 3 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 23 days ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
JAIR
2012
211views Hardware» more  JAIR 2012»
11 years 9 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla
MYCRYPT
2005
Springer
248views Cryptology» more  MYCRYPT 2005»
14 years 26 days ago
A Family of Fast Syndrome Based Cryptographic Hash Functions
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
JELIA
2010
Springer
13 years 5 months ago
Translating First-Order Causal Theories into Answer Set Programming
Abstract. Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional caus...
Vladimir Lifschitz, Fangkai Yang
EATCS
2000
67views more  EATCS 2000»
13 years 7 months ago
Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey
A sub-area of discrepancy theory that has received much attention in computer science recently, is that of explicit constructions of low-discrepancy point sets for various types o...
A. Srinivasan