13603 search results - page 34 / 2721 » On the Computational Complexity of Cut-Reduction |
COMPUTING
1998
13 years 8 months ago
1998
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
RTA
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
NSDI
2008
13 years 10 months ago
2008
The systems and networking community treasures "simple" system designs, but our evaluation of system simplicity often relies more on intuition and qualitative discussion...
SIAMCOMP
2000
13 years 8 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...