Completeness, approximability and exponential time results for counting problems with easy decision version von Antonopoulos, Antonis, Bakali, Eleni, Chalki, Aggeliki, Pagourtzis, Aris, Pantavos, Petros, Zachos, Stathis

Volltext

On the Power of Counting the Total Number of Computation Paths of NPTMs von Bakali, Eleni, Chalki, Aggeliki, Kanellopoulos, Sotiris, Pagourtzis, Aris, Zachos, Stathis

Volltext

On randomized counting versus randomised decision von Bakali, Eleni

Volltext bestellen

Relating counting complexity to non-uniform probability measures von Bakali, Eleni

Volltext bestellen

Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower b... von Bakali, Eleni

Volltext bestellen

Completeness Results for Counting Problems with Easy Decision von Bakali, Eleni, Chalki, Aggeliki, Pagourtzis, Aris, Pantavos, Petros, Zachos, Stathis

Volltext

On the power of counting the total number of computation paths of NPTMs von Bakali, Eleni, Chalki, Aggeliki, Kanellopoulos, Sotiris, Pagourtzis, Aris, Zachos, Stathis

Volltext bestellen

Exact uniform sampling over catalan structures von Angelopoulos, Alexandros, Bakali, Eleni

Volltext bestellen

Guest column: A panorama of counting problems the decision version of which is in P 3 von Bakali, Eleni, Chalki, Aggeliki, Göbel, Andreas, Pagourtzis, Aris, Zachos, Stathis

Volltext

On randomized counting versus randomised decision von Bakali, Eleni

Volltext

Relating counting complexity to non-uniform probability measures von Bakali, Eleni

Volltext

Characterizations and approximability of hard counting classes below #P von Bakali, Eleni, Chalki, Aggeliki, Pagourtzis, Aris

Volltext bestellen

Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower b... von Bakali, Eleni

Volltext

On the power of counting the total number of computation paths of NPTMs von Bakali, Eleni, Chalki, Aggeliki, Kanellopoulos, Sotiris, Pagourtzis, Aris, Zachos, Stathis

Volltext

Stathis Zachos at 70 von Bakali, Eleni, Cheilaris, Panagiotis, Fotakis, Dimitris, Fürer, Martin, Koutras, Costas D., Markou, Euripides, Nomikos, Christos, Pagourtzis, Aris, Papadimitriou, Christos H., Papaspyrou, Nikolaos S., Potika, Katerina

Volltext

Exact uniform sampling over catalan structures von Angelopoulos, Alexandros, Bakali, Eleni

Volltext

Characterizations and Approximability of Hard Counting Classes Below \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssy... von Bakali, Eleni, Chalki, Aggeliki, Pagourtzis, Aris

Volltext

Characterizations and approximability of hard counting classes below #P von Bakali, Eleni, Chalki, Aggeliki, Pagourtzis, Aris

Volltext

Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users von Karaliopoulos, Merkouris, Bakali, Eleni

Volltext