13603 search results - page 63 / 2721 » On the Computational Complexity of Cut-Reduction |
COMSIS
2010
14 years 7 months ago
2010
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
COLING
1992
14 years 11 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
108
click to vote
LICS
2012
IEEE
13 years 7 days ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
AAAI
2004
14 years 11 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...