Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
65
A note on dimensions of polynomial size circuits
- Electronic Colloquium on Computational Complexity
, 2004
"... In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i ≥ 0, P/poly has ith order scaled p 3-strong dimension 0. We also show that P/poly i.o. has p ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i ≥ 0, P/poly has ith order scaled p 3-strong dimension 0. We also show that P/poly i.o. has p
Thermionic Current Modeling and Equivalent Circuit of
"... Abstract:- We explore the relation between photogeneration and recombination currents in an illuminated III-V p-i-n multiple quantum well (mqw) solar cell, via an improved p-n junction equivalent circuit. P-i-n solar cells with their intrinsic region replaced by a multilayered heterostructure (e.g. ..."
Abstract
- Add to MetaCart
resistance of such devices. General relations are developed for open circuit voltage Voc, short circuit current Isc, incident power, all as functions of net (after recombination) thermionic currents Ith = Iph – Ir. The basic device equivalent circuit is improved by including (a) a photogeneration current
Min-Rank Conjecture for Log-Depth Circuits
"... A completion of an m-by-n matrix A with entries in {0, 1, ∗} is obtained by setting all ∗-entries to constants 0 and 1. A system of semi-linear equations over GF 2 has the form M x = f (x), where M is a completion of A and f: {0, 1} n → {0, 1} m is an operator, the ith coordinate of which can only d ..."
Abstract
- Add to MetaCart
A completion of an m-by-n matrix A with entries in {0, 1, ∗} is obtained by setting all ∗-entries to constants 0 and 1. A system of semi-linear equations over GF 2 has the form M x = f (x), where M is a completion of A and f: {0, 1} n → {0, 1} m is an operator, the ith coordinate of which can only
Approximate list-decoding of direct product . . .
"... Given a message msg ∈ {0, 1} N, its k-wise direct product encoding is the sequence of k-tuples (msg(i1),..., msg(ik)) over all possible k-tuples of indices (i1,..., ik) ∈ {1,..., N} k. We give an efficient randomized algorithm for approximate local list-decoding of direct product codes. That is, gi ..."
Abstract
-
Cited by 33 (8 self)
- Add to MetaCart
) fraction of positions. The decoding is local in that our algorithm outputs a list of Boolean circuits so that the jth bit of the ith output string can be computed by running the ith circuit on input j. The running time of the algorithm is polynomial in log N and 1/ɛ. In general, when ɛ> e−kα for a
A Cadence-Based Design Environment for Single Flux Quantum Circuits
"... ã The semiconductor industry standard computeraided -design (CAD) toolset, Cadence, has been calibrated for a 3- µmNiobium technology in order to design superconductive single flux quantum (SFQ) circuits. The top-down design methodology includes, but is not limited to, Verilog functional simulation ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
-signal circuits to improve both design efficiency andaccuracy. I. INTRODUCTION ITH a junction switching speed on the order of picoseconds and power consumption of approximately 0.2 µW/junction, SFQ circuits have superior performance characteristics compared with semiconductor technologies [1]. However, due
Computational neuroscience: beyond the local circuit ScienceDirect
"... Computational neuroscience has focused largely on the dynamics and function of local circuits of neuronal populations dedicated to a common task, such as processing a common sensory input, storing its features in working memory, choosing between a set of options dictated by controlled experimental ..."
Abstract
- Add to MetaCart
Computational neuroscience has focused largely on the dynamics and function of local circuits of neuronal populations dedicated to a common task, such as processing a common sensory input, storing its features in working memory, choosing between a set of options dictated by controlled experimental
A DESCRIPTION OF THE PARRY-SULLIVAN NUMBER OF A GRAPH USING CIRCUITS
, 903
"... Abstract. In this short note, we give a description of the Parry-Sullivan number of a graph in terms of the cycles in the graph. This tool is occasionally useful in reasoning about the Parry-Sullivan numbers of graphs. Given a graph E with n vertices, one may define the incidence matrix AE as the n ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
× n matrix wherein each entry (AE)ij is defined to be the number of edges in E from the ith vertex to the jth vertex. Parry and Sullivan showed the quantity det(I − AE), now known as the Parry-Sullivan number of the graph and denoted PS(E), is an invariant of the flow equivalence class of the subshift
SOME RECENT RESULTS ON EXTREMAL PROBLEMS IN GRAPH THEORY (Results)
"... Three years ago I gave a talk on extremal problems in graph theory at Smolenice [2]. I will refer to this paper as I. I will only discuss results which have been found since the publication of I. ~(9) will denote the number of vertices, V(g) the number of edges of 9. s(a; I) will denote a graph of n ..."
Abstract
-
Cited by 38 (1 self)
- Add to MetaCart
vertices 9 r; ( 01; ’ UP i,.... p,) denotes the complete r-chromatic graph with pi vertices of the i-th colour in which every two vertices of different colour are adjacent. C, is a circuit having y1 edges. Denote by f(n;?Jr,.... 9,) the smallest integer so that every +qn if @ ; 91, ***, 9k8,)) contains
Gate evaluation secret sharing and secure one-round two-party computation
- In ASIACRYPT’05, volume 3788 of LNCS
, 2005
"... Abstract. We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simple and powerful GESS approach to SFE is a generalization of Yao’s garbled circuit technique. We give efficient ..."
Abstract
-
Cited by 17 (10 self)
- Add to MetaCart
Abstract. We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simple and powerful GESS approach to SFE is a generalization of Yao’s garbled circuit technique. We give efficient
Classical adiabatic angles and quantal adiabatic phase
, 1985
"... A semiclassical connection IS established between quantal and classical properties of a system whose Hamiltonian is slowly cycled by varying its parameters round a circuit. The quantal property is a geometrical phase shift y,, associated with an eigenstate with quantum numbers n = {n,}: the classi ..."
Abstract
-
Cited by 22 (0 self)
- Add to MetaCart
A semiclassical connection IS established between quantal and classical properties of a system whose Hamiltonian is slowly cycled by varying its parameters round a circuit. The quantal property is a geometrical phase shift y,, associated with an eigenstate with quantum numbers n = {n
Results 1 - 10
of
65
