We provide an almost characterization of the approximation classes appearing when using adaptive finite elements of Lagrange type of any fixed polynomial degree. The characterization is stated in terms of Besov regularity, ...

Given a graph G=(V,E) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a ...

We study approximation classes for adaptive time-stepping finite element methods for time-dependent Partial Differential Equations (PDE). We measure the approximation error in L2([0, T) × Ω) and consider the approximation ...

When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. ...

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational ...

In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, ...

In a 2015 article Cuenya and Ferreyra defined a class of functions in Lp-spaces, denoted by cpn(x). The class cpn(x) contains the class of Lp -differentiability functions, denoted by tpn(x), introduced in a 1961 article ...