Sciweavers

331 search results - page 18 / 67
» New Results on the Pseudorandomness of Some Blockcipher Cons...
Sort
View
ASWEC
2000
IEEE
14 years 1 months ago
Storing and Retrieving Software Components: A Component Description Manager
The aim of the paper is to present the results of research into Component-Based software development by providing a specification mechanism allowing searching for components in a ...
Rune Meling, E. James Montgomery, Pon Sudha Ponnus...
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 4 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen
ICALP
2009
Springer
14 years 9 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 9 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
CIE
2009
Springer
14 years 3 months ago
Ordinal Computability
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
Peter Koepke