Sciweavers

1225 search results - page 26 / 245
» The Instance Complexity Conjecture
Sort
View
IH
2009
Springer
14 years 2 months ago
Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...
Nathan Beckmann, Miodrag Potkonjak
FOCS
2002
IEEE
14 years 19 days ago
Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra...
ANTS
2006
Springer
114views Algorithms» more  ANTS 2006»
13 years 11 months ago
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
Jonathan Sorenson
DM
2007
72views more  DM 2007»
13 years 7 months ago
Multicomplexes and polynomials with real zeros
We show that each polynomial a(z)=1+a1z+· · ·+adzd in N[z] having only real zeros is the f-polynomial of a multicomplex. It follows that a(z) is also the h-polynomial of a Cohe...
Jason Bell, Mark Skandera
COCOON
2009
Springer
14 years 2 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch