MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "A New High Performance Embedded "Hard Core" Vector DSP Architecture for Multimedia Applications." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

254,658 documents found, showing 1 through 10. Next 10 →

ATOM

Hard-Core Distributions for Somewhat Hard Problems
by Russell Impagliazzo — 1995 — In 36th Annual Symposium on Foundations of Computer Science
… such problem there is a specific "hard-core" set of inputs which is at least a ffi fraction of all inputs…
Cited by 73 (10 self) – Add To MetaCart

Boosting and hard-core sets
by Adam R. Klivans, Rocco A. Servedio — 1999 — In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science
… show how to use Impagliazzo’s hard-core set construction to obtain a new variant of Jackson…
Cited by 28 (8 self) – Add To MetaCart

Multisymbol Majority Vote and Hard Core
by Wakaha Ogata Keiichi, Kaoru Kurosawa
… to obtain a hard core of k0symbol one way funcitons. 1 Introduction In the eld of complexity theory, a \k0…
Add To MetaCart

Hard Instances of Hard Problems
by Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
… has essentially maximal instance complexity. It follows that every weakly hard problem has a dense set…
Add To MetaCart

Universal Hash Functions & Hard Core Bits
by Mats Näslund — 1995
… hard-core bits can serve as these extra bits. Intuitively, a hard-core bit is a 0--1 function…
Cited by 9 (3 self) – Add To MetaCart

Kolmagorov Complexity, Complexity Cores, and the Distribution of Hardness
by David W. Juedes, Jack H. Lutz — 1992 — KOLMOGOROV COMPLEXITY: THEORY AND RELATIONS TO COMPUTATIONAL COMPLEXITY
…-theoretic applications of an almost-everywhere lower bound on KS t (An )[Lut92a], we prove a new almost everywhere…
Add To MetaCart

Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness
by David W. Juedes, Jack H. Lutz — 1992 — Kolmogorov Complexity: Theory and Relations to Computational Complexity
… complexity-theoretic applications of an almost-everywhere lower bound on KS t (An )[Lut92a], we prove a new…
Cited by 4 (3 self) – Add To MetaCart

Hard-Core Bits for Proofs of Knowledge
by Stefan Brands — 1997
… into the hard-core bits of a randomly chosen argument x of a one-way permutation f(\Delta). In case…
Add To MetaCart

Hard-Core Bits for Proofs of Knowledge
by Stefan Brands April
… the new notion of hard-core bits for proofs of knowledge. If a proof of knowledge for a relation…
Add To MetaCart

Bit Extraction, Hard-Core Predicates, and the
by Bit Security Of
… This thesis presents results on bit security and bit extraction. 1. A function b(·) is called secure or a hard-core…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB