A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Analytical modeling of the performance of video coders is essential in a variety of applications, such as power-constrained processing, complexity-driven video streaming, etc., whe...
Brian Foo, Yiannis Andreopoulos, Mihaela van der S...
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...