1092 search results - page 62 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
161
Voted
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
160
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
148
click to vote
AAAI
1998
15 years 7 months ago
1998
The Integrated Processing and Understanding of Signals (IPUS) architecture is a general blackboard framework for structuring bidirectional interaction between front-end signal pro...
164
click to vote
ICCAD
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
154
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...