Sciweavers

1017 search results - page 45 / 204
» Some existence and construction results of polygonal designs
Sort
View
WEWORC
2007
162views Cryptology» more  WEWORC 2007»
15 years 1 months ago
New Attacks on the Stream Cipher TPy6 and Design of New Ciphers the TPy6-A and the TPy6-B
The stream ciphers Py, Pypy and Py6 were designed by Biham and Seberry for the ECRYPT-eSTREAM project in 2005. The ciphers were promoted to the ‘Focus’ ciphers of the Phase II ...
Gautham Sekar, Souradyuti Paul, Bart Preneel
FOCS
2008
IEEE
15 years 6 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
SAC
2004
ACM
15 years 5 months ago
A core calculus of higher-order mixins and classes
This work presents an object-oriented calculus based on higher-order mixin construction via mixin composition, where some software engineering requirements are modeled in a formal ...
Lorenzo Bettini, Viviana Bono, Silvia Likavec
PODS
2009
ACM
136views Database» more  PODS 2009»
16 years 11 days ago
Distributed XML design
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
Serge Abiteboul, Georg Gottlob, Marco Manna
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 6 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...