13603 search results - page 66 / 2721 » On the Computational Complexity of Cut-Reduction |
152
click to vote
FSTTCS
1994
Springer
15 years 10 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
143
click to vote
DLT
2009
15 years 3 months ago
2009
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
158
click to vote
AML
2007
15 years 6 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
163
click to vote
JASSS
2002
15 years 5 months ago
2002
In a paper published in JASSS, Chris Goldspink discusses the methodological implications of complex systems approaches to the modeling of social systems. Like others before him Go...
150
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X