272 search results - page 19 / 55 » Programming languages capturing complexity classes |
96
Voted
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
87
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
106
click to vote
LPNMR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...