268 search results - page 35 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
ECCC
2000
14 years 9 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
106
Voted
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
107
click to vote
MA
1999
Springer
15 years 1 months ago
1999
Springer
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...