The complexity and approximability of finding maximum feasible subsystems of linear relations

By Amaldi E.   Kann V.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 181-210

Elsevier

Access to resources Recommend Favorite

Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity

By V'yugin V. V.   Maslov V. P.  

Problems of Information Transmission, Vol. 39, Iss. 4, 2003-10 ,pp. : 380-394

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A general method to construct oracles realizing given relationships between complexity classes

By Muchnik A.A.   Vereshchagin N.K.  

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 227-258

Elsevier

Access to resources Recommend Favorite

A descriptive complexity approach to the linear hierarchy

By Hachaichi Y.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 421-429

Elsevier

Access to resources Recommend Favorite

Comparison between the complexity of a function and the complexity of its graph

By Durand B.   Porrot S.  

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 37-46

Elsevier

Access to resources Recommend Favorite