Skip to main content

Theory of Computing Systems

Ausgabe 2/2015

Inhalt (8 Artikel)

On the Turing Completeness of the Semantic Web

Amir Pourabdollah, Tim Brailsford

Rent or Buy Problems with a Fixed Time Horizon

Leah Epstein, Hanan Zebedat-Haider

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set

Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao

Estimating the Volume of Solution Space for Satisfiability Modulo Linear Real Arithmetic

Min Zhou, Fei He, Xiaoyu Song, Shi He, Gangyi Chen, Ming Gu

Hardness of Approximation for Knapsack Problems

Harry Buhrman, Bruno Loff, Leen Torenvliet

Open Access

Sitting Closer to Friends than Enemies, Revisited

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Generalized River Crossing Problems

Hiro Ito, Stefan Langerman, Yuichi Yoshida

Premium Partner