On the parameterized complexity of approximate counting

E-ISSN： 1290-385x|45|2|197-223

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.45, Iss.2, 2011-06, pp. : 197-223

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

By Bouafia Mousaab Benterki Djamel Yassine Adnan

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 935-949

Edp Sciences

Access to resources Recommend Favorite

Monitoring gears by vibration measurements: Lempel-Ziv complexity and Approximate Entropy as diagnostic tools

By Kedadouche Mourad

MATEC Web of conference, Vol. 20, Iss. issue, 2015-01 ,pp. : 07001-07001

Edp Sciences

Access to resources Recommend Favorite

Parameter uncertainty in a highly parameterized model of Lake Okeechobee

By Dilks David W.

Lake and Reservoir Management, Vol. 27, Iss. 4, 2011-12 ,pp. : 376-389

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dual parameterization and parameterized approximability of subset graph problems

By Bonnet Édouard Paschos Vangelis Th.

RAIRO - Operations Research, Vol. 51, Iss. 1, 2017-02 ,pp. : 261-266

Edp Sciences

Access to resources Recommend Favorite

Immunity and Simplicity for Exact Counting and Other CountingClasses

By Rothe J.

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 2, 2010-03 ,pp. : 159-176

Edp Sciences

Access to resources Recommend Favorite