Sciweavers

2661 search results - page 56 / 533
» Quantum Complexity Classes
Sort
View
LICS
1999
IEEE
15 years 5 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
76
Voted
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
15 years 7 months ago
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
Shengyu Zhang
PPOPP
2005
ACM
15 years 6 months ago
Performance modeling and optimization of parallel out-of-core tensor contractions
The Tensor Contraction Engine (TCE) is a domain-specific compiler for implementing complex tensor contraction expressions arising in quantum chemistry applications modeling elect...
Xiaoyang Gao, Swarup Kumar Sahoo, Chi-Chung Lam, J...
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 21 days ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
124
Voted
AUTOMATICA
1999
62views more  AUTOMATICA 1999»
15 years 12 days ago
Complexity of stability and controllability of elementary hybrid systems
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
Vincent D. Blondel, John N. Tsitsiklis