1226 search results - page 38 / 246 » Proofs, Programs and Abstract Complexity |
150
Voted
FROCOS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
131
click to vote
ICTCS
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
142
click to vote
COCO
1993
Springer
15 years 6 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
102
Voted
CACM
2007
15 years 2 months ago
2007
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
103
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...