13603 search results - page 113 / 2721 » On the Computational Complexity of Cut-Reduction |
174
Voted
JCST
2010
15 years 26 days ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
193
click to vote
CSR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
174
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
Force feedback coupled with visual display allows people to interact intuitively with complex virtual environments. For this synergy of haptics and graphics to flourish, however, ...
132
click to vote
COCO
1990
Springer
15 years 10 months ago
1990
Springer
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...