On computational complexity of contextual languages

By Ilie L.  

Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. : 33-44

Elsevier

Access to resources Recommend Favorite

On computational complexity of graph inference from counting

By Fazekas Szilárd   Ito Hiro   Okuno Yasushi   Seki Shinnosuke   Taneishi Kei  

Natural Computing, Vol. 12, Iss. 4, 2013-12 ,pp. : 589-603

Springer Publishing Company

Access to resources Recommend Favorite

Counting and enumeration complexity with application to multicriteria scheduling

By T’kindt Vincent  

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite

Recursion theoretic characterizations of complexity classes of counting functions

By Vollmer H.   Wagner K.W.  

Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. : 245-258

Elsevier

Access to resources Recommend Favorite

Gap-languages and log-time complexity classes

By Regan K.W.   Vollmer H.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 101-116

Elsevier

Access to resources Recommend Favorite