364 search results - page 29 / 73 » Dimension Characterizations of Complexity Classes |
126
Voted
BIRTHDAY
2004
Springer
15 years 4 months ago
2004
Springer
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...
92
Voted
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
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...
118
click to vote
TSP
2008
15 years 14 days ago
2008
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...
DNA
2006
Springer
15 years 4 months ago
2006
Springer
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...
114
click to vote
MST
2007
15 years 2 days ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...