Characterizations and Approximability of Hard Counting Classes Below #P

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TAMC (16. : 2020 : Online) Theory and applications of models of computation
1. Verfasser: Bakali, Eleni (VerfasserIn)
Weitere Verfasser: Chalki, Aggeliki (VerfasserIn), Pagourtzis, Aris (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2020
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Floorplans with Walls 2020 Yamanaka, Katsuhisa
Reverse Mathematics, Projective Modules and Invertible Modules 2020 Wu, Huishan
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint 2020 Sun, Xin
On Coresets for Support Vector Machines 2020 Tukan, Murad
Tractabilities for Tree Assembly Problems 2020 Shi, Feng
Disjunctive Propositional Logic and Scott Domains 2020 Wang, Longchun
The Complexity of the Partition Coloring Problem 2020 Guo, Zhenyu
On Pure Space vs Catalytic Space 2020 Bisoyi, Sagar
Semilattices of Punctual Numberings 2020 Bazhenov, Nikolay
Polynomial Kernels for Paw-Free Edge Modification Problems 2020 Cao, Yixin
Partial Sums on the Ultra-Wide Word RAM 2020 Bille, Philip
Securely Computing the n-Variable Equality Function with 2n Cards 2020 Ruangwises, Suthee
A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem 2020 Chen, Wenbin
Sumcheck-Based Delegation of Quantum Computing to Rational Server 2020 Takeuchi, Yuki
An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem 2020 Zhang, Zhen
A Constant Factor Approximation for Lower-Bounded k-Median 2020 Guo, Yutian
On the Complexity of Acyclic Modules in Automata Networks 2020 Perrot, Kévin
Parametric Streaming Two-Stage Submodular Maximization 2020 Yang, Ruigi
Approximate #Knapsack Computations to Count Semi-fair Allocations 2020 Triommatis, Theofilos
Space Complexity of Streaming Algorithms on Universal Quantum Computers 2020 Hu, Yanglin
Alle Artikel auflisten