258 search results - page 37 / 52 » Weak Bisimulation Approximants |
83
Voted
CRYPTO
1993
Springer
15 years 1 months ago
1993
Springer
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is appro...
SAS
2000
Springer
15 years 1 months ago
2000
Springer
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
COSIT
1995
Springer
15 years 1 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...