16666 search results - page 284 / 3334 » Descriptive and Computational Complexity |
202
click to vote
Lecture Notes
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001.
The focus of this chapter is on the Gen...
153
click to vote
JC
2006
15 years 6 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
174
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
160
click to vote
LOGCOM
2007
15 years 6 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
150
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...