900 search results - page 51 / 180 » On Polynomial Time Computation over Unordered Structures |
FSTTCS
1992
Springer
14 years 1 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
PPSWR
2005
Springer
14 years 2 months ago
2005
Springer
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Physical processes are computations only when we use them to externalize thought. Entities provide nature with a way to preserve structure over time. We think in terms of entities ...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We introduce a theoretical framework and practical algorithms for replacing time-coded structured light patterns with viewpoint codes, in the form of additional camera locations. ...