216 search results - page 26 / 44 » On the number of minima of a random polynomial |
CRYPTO
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
ASPDAC
2010
ACM
13 years 5 months ago
2010
ACM
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...