55 search results - page 1 / 11 » Feasible Depth |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
JSYML
2010
13 years 3 months ago
2010
Let L be a first-order language and Φ and Ψ two Σ1 1 L-sentences that cannot be satisfied simultaneously in any finite L-structure. Then obviously the following principle Cha...
APAL
1999
13 years 4 months ago
1999
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
— We propose a novel modular underwater robot which can self-reconfigure by stacking and unstacking its component modules. Applications for this robot include underwater monitor...
QSHINE
2005
IEEE
13 years 10 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...