Sciweavers

21520 search results - page 103 / 4304
» Symmetric network computation
Sort
View
EUROCRYPT
2005
Springer
15 years 11 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
PC
2010
145views Management» more  PC 2010»
15 years 3 months ago
GPU computing with Kaczmarz's and other iterative algorithms for linear systems
The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-...
Joseph M. Elble, Nikolaos V. Sahinidis, Panagiotis...
IJMMS
2006
108views more  IJMMS 2006»
15 years 5 months ago
Computational modeling and experimental investigation of effects of compositional elements on interface and design aesthetics
This article describes computational modeling and two corresponding experimental investigations of the effects of symmetry, balance and quantity of construction elements on interf...
Michael Bauerly, Yili Liu
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 5 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
154
Voted
CADE
2002
Springer
16 years 5 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg