13603 search results - page 387 / 2721 » On the Computational Complexity of Cut-Reduction |
195
Voted
ICALP
2003
Springer
16 years 24 days ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
180
click to vote
DEXAW
1999
IEEE
15 years 12 months ago
1999
IEEE
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
210
click to vote
STOC
2010
ACM
16 years 13 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
204
click to vote
CIE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
199
click to vote
CHI
1995
ACM
15 years 11 months ago
1995
ACM
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...