A characterization of the class of functions computable in polynomial time on Random Access Machines

1981 ◽  
Author(s):  
Alberto Bertoni ◽  
Giancarlo Mauri ◽  
Nicoletta Sabadini
Keyword(s):  
Polynomial Time ◽  
Random Access ◽  
Class Of Functions

scholarly journals Characterization of coded random access with compressive sensing based multi-user detection

2014 ◽  
Author(s):  
Yalei Ji ◽  
Cedomir Stefanovic ◽  
Carsten Bockelmann ◽  
Armin Dekorsy ◽  
Petar Popovski
Keyword(s):  
Compressive Sensing ◽  
Random Access

Characterization of Oxygen Accumulation in Indium-Tin-Oxide for Resistance Random Access Memory

2014 ◽  
Vol 35 (6) ◽  
pp. 630-632 ◽  
Author(s):  
Rui Zhang ◽  
Tai-Fa Young ◽  
Min-Chen Chen ◽  
Hsin-Lu Chen ◽  
Shu-Ping Liang ◽  
...  
Keyword(s):  
Tin Oxide ◽  
Indium Tin Oxide ◽  
Random Access ◽  
Random Access Memory ◽  
Access Memory ◽  
Resistance Random Access Memory

scholarly journals Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces

10.37236/3540 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Dong Ye ◽  
Heping Zhang
Keyword(s):  
Bipartite Graph ◽  
Polynomial Time ◽  
Perfect Matching ◽  
Cartesian Product ◽  
Perfect Matchings ◽  
Face Width ◽  
Graphs On Surfaces ◽  
Positive Genus ◽  
Pfaffian Graph

A graph $G$ with a perfect matching is Pfaffian if it admits an orientation $D$ such that every central cycle $C$ (i.e. $C$ is of even size and $G-V(C)$ has a perfect matching) has an odd number of edges oriented in either direction of the cycle. It is known that the number of perfect matchings of a Pfaffian graph can be computed in polynomial time. In this paper, we show that every embedding of a Pfaffian brace (i.e. 2-extendable bipartite graph)  on a surface with a positive genus has face-width at most 3.  Further, we study Pfaffian cubic braces and obtain a characterization of Pfaffian polyhex graphs: a polyhex graph is Pfaffian if and only if it is either non-bipartite or isomorphic to the cube, or the Heawood graph, or the Cartesian product $C_k\times K_2$ for even integers $k\ge 6$.

scholarly journals On characterizations of the basic feasible functionals, Part I

2001 ◽  
Vol 11 (1) ◽  
pp. 117-153 ◽  
Author(s):  
ROBERT J. IRWIN ◽  
JAMES S. ROYER ◽  
BRUCE M. KAPRON
Keyword(s):  
Polynomial Time ◽  
Theoretic Characterization

We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP2, that characterizes the type-2 basic feasible functionals. ITLP2 is based on Bellantoni and Cook's (1992) and Leivant's (1995) type-theoretic characterization of polynomial-time, and turns out to be closely related to Kapron and Cook's (1991; 1996) machine-based characterization of the type-2 basic feasible functionals.

Transistor-level characterization of static random access memory bit failures induced by random telegraph noise

2016 ◽  
Vol 55 (4S) ◽  
pp. 04ED05 ◽  
Author(s):  
Tomoko Mizutani ◽  
Takuya Saraya ◽  
Kiyoshi Takeuchi ◽  
Masaharu Kobayashi ◽  
Toshiro Hiramoto
Keyword(s):  
Random Access ◽  
Random Access Memory ◽  
Static Random Access Memory ◽  
Access Memory ◽  
Random Telegraph Noise ◽  
Telegraph Noise

scholarly journals Characterization of Ferroelectric Random Access Memory (FRAM) Storage Capacitors

2020 ◽  
Vol 26 (S2) ◽  
pp. 1404-1405
Author(s):  
Sahar Hihath ◽  
Hannah Harter ◽  
Jerry Fortier ◽  
David Flowers
Keyword(s):  
Random Access ◽  
Random Access Memory ◽  
Access Memory ◽  
Ferroelectric Random Access Memory

scholarly journals Geometric applications of critical point theory to submanifolds of complex projective space

1974 ◽  
Vol 55 ◽  
pp. 5-31 ◽  
Author(s):  
Thomas E. Cecil
Keyword(s):  
Projective Space ◽  
Critical Point ◽  
Distance Function ◽  
Complex Projective Space ◽  
Euclidean Distance ◽  
Point Theory ◽  
Euclidean Distance Function ◽  
Complex Projective ◽  
Class Of Functions

In a recent paper, [6], Nomizu and Rodriguez found a geometric characterization of umbilical submanifolds Mn ⊂ Rn+p in terms of the critical point behavior of a certain class of functions Lp, p ⊂ Rn+p, on Mn. In that case, if p ⊂ Rn+p, x ⊂ Mn, then Lp(x) = (d(x,p))2, where d is the Euclidean distance function.

scholarly journals BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS

2005 ◽  
Vol 16 (05) ◽  
pp. 1039-1070 ◽  
Author(s):  
LILA KARI ◽  
STAVROS KONSTANTINIDIS ◽  
PETR SOSÍK
Keyword(s):  
Polynomial Time ◽  
Structural Characterization ◽  
Regular Languages ◽  
Important Case ◽  
Similarity Relation ◽  
Construction Methods ◽  
Large Sets ◽  
Code Property ◽  
Context Free

The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define the property of sim-bond-freedom, where sim is a similarity relation between words. We show that this property is decidable for context-free languages and polynomial-time decidable for regular languages. The maximality of this property also turns out to be decidable for regular languages and polynomial-time decidable for an important case of the Hamming similarity. Then we consider various construction methods for Hamming bond-free languages, including the recently introduced method of templates, and obtain a complete structural characterization of all maximal Hamming bond-free languages. This result is applicable to the θ-k-code property introduced by Jonoska and Mahalingam.

Reliability and Characterization of Composite Oxide/Nitride Dielectrics for Multi‐Megabit Dynamic Random Access Memory Stacked Capacitors

1991 ◽  
Vol 138 (7) ◽  
pp. 2052-2057 ◽  
Author(s):  
P. C. Fazan ◽  
A. Ditali ◽  
C. H. Dennison ◽  
H. E. Rhodes ◽  
H. C. Chan ◽  
...  
Keyword(s):  
Random Access ◽  
Random Access Memory ◽  
Dynamic Random Access Memory ◽  
Access Memory ◽  
Composite Oxide
Sign in / Sign up

Export Citation Format

Share Document