Relations between Average-Case and Worst-Case Complexity

By Pavan A.  

Theory of Computing Systems, Vol. 42, Iss. 4, 2008-05 ,pp. : 596-607

Springer Publishing Company

Access to resources Recommend Favorite

Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm

By Borgwardt Karl Heinz  

Discrete & Computational Geometry, Vol. 37, Iss. 2, 2007-02 ,pp. : 175-204

Springer Publishing Company

Access to resources Recommend Favorite

Logspace Optimization Problems and Their Approximability Properties

By Tantau Till  

Theory of Computing Systems, Vol. 41, Iss. 2, 2007-08 ,pp. : 327-350

Springer Publishing Company

Access to resources Recommend Favorite

Well posedness and finite element approximability of two-dimensional time-harmonic electromagnetic problems involving non-conducting moving objects with stationary boundaries

By Brignone Massimo   Raffetto Mirco  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 49, Iss. 4, 2015-06 ,pp. : 1157-1192

Edp Sciences

Access to resources Recommend Favorite

Invex optimisation problems

By  

Bulletin of the Australian Mathematical Society, Vol. 46, Iss. 1, 1992-08 ,pp. : 47-66

Cambridge University Press

Access to resources Recommend Favorite