468 search results - page 31 / 94 » One-Way Functions in Complexity Theory |
110
click to vote
COCO
1994
Springer
15 years 3 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
96
Voted
BMCBI
2010
14 years 8 months ago
2010
Background: High complexity is considered a hallmark of living systems. Here we investigate the complexity of temporal gene expression patterns using the concept of Permutation En...
COMPGEOM
2008
ACM
15 years 25 days ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
GIS
2010
ACM
14 years 9 months ago
2010
ACM
Many researchers throughout the world have been struggling to better understand and describe Spatial Data Infrastructures (SDIs). Our knowledge of the real forces and mechanisms b...
104
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...