65 search results - page 9 / 13 » Preservation theorems for bounded formulas |
107
Voted
GG
2004
Springer
15 years 5 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
ENTCS
2006
15 years 12 days ago
2006
Functors which are determined, up to natural isomorphism, by their values on objects, are called DVO (Defined by Values on Objects). We focus on the collection of polynomial funct...
93
Voted
CSL
2005
Springer
15 years 6 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
123
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
DCG
2010
15 years 14 days ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...