229 search results - page 17 / 46 » Proving Bounds on Real-Valued Functions with Computations |
CIE
2007
Springer
15 years 4 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
CIE
2006
Springer
15 years 1 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
104
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...