Sciweavers

1695 search results - page 16 / 339
» Linear, Polynomial or Exponential
Sort
View
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 4 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
110
Voted
ICALP
2009
Springer
16 years 29 days ago
Unconditional Lower Bounds against Advice
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
Harry Buhrman, Lance Fortnow, Rahul Santhanam
128
Voted
AUTOMATICA
2011
14 years 7 months ago
Interval observers for linear time-invariant systems with disturbances
It is shown that, for any time-invariant exponentially stable linear system with additive disturbances, time-varying exponentially stable interval observers can be constructed. Th...
Frédéric Mazenc, Olivier Bernard
106
Voted
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 10 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao
STOC
1990
ACM
96views Algorithms» more  STOC 1990»
15 years 4 months ago
Monotone Circuits for Matching Require Linear Depth
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
Ran Raz, Avi Wigderson