Sciweavers

2661 search results - page 194 / 533
» Quantum Complexity Classes
Sort
View
129
Voted
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 10 months ago
Enumerating randoms
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
Bjørn Kjos-Hanssen, Frank Stephan, Jason Te...
119
Voted
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 7 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
124
Voted
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 7 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
ESWA
2007
105views more  ESWA 2007»
15 years 3 months ago
Applying rough sets to prevent customer complaints for IC packaging foundry
Packaging is classified as one of back-end processes in the integrated circuits (ICs) manufacturing, highly capital-intensive and involves complex processes. Unlike the front-end...
Hsu-Hao Yang, Tzu-Chiang Liu, Yen-Ting Lin
119
Voted
CCR
2004
110views more  CCR 2004»
15 years 3 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer