468 search results - page 13 / 94 » One-Way Functions in Complexity Theory |
CIE
2006
Springer
15 years 2 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...
CLEIEJ
2002
14 years 10 months ago
2002
Function Point Analysis (FPA) is among the most commonly used techniques to estimate the size of software system projects or software systems. During the point counting process th...
LICS
2008
IEEE
15 years 5 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
88
Voted
3DPH
2009
14 years 8 months ago
2009
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
94
Voted
ATAL
2010
Springer
15 years 22 hour ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...