A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Every 1-generic computes a properly 1-generic
2006
Journal of Symbolic Logic (JSL)
Preserved Fulltext
A real is called properly n-generic if it is n-generic but not n + 1-generic. We show that every 1-generic real computes a properly 1-generic real. ...
On the other hand, if m > n ≥ 2 then an m-generic real cannot compute a properly n-generic real. ...
Computing properly 1-generic sets In this section we prove theorem 1.4: Every 1-generic real X computes a 1-generic real that is not weakly 2-generic. ...
doi:10.2178/jsl/1164060461
fatcat:v5wuewhr4zfgxivpklcxf3l7ci
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We achieve this last result by applying the dual system encryption methodology in a novel way. ...
The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. ...
order to compute a generator of G p2 . ...
doi:10.1007/978-3-319-29485-8_25
fatcat:vewhqykqmvbydfolhn6qma3kia
Page 4691 of Mathematical Reviews Vol. , Issue 97H
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
It proves that (1) between any two comparable r.e. degrees there is a properly d-r.e. degree which is not isolated by any re. degree, (2) there is a nonzero r.e. degree a which isolates no degree re. in ...
They showed that (i) there exists an isolated d- r.e. degree, (ii) there exists a nonisolated properly d-r.e. degree (a d-r.e. degree is properly d-r.e. if it contains no r.e. set), and (ili) given any ...
von Neumann algebras generated by operators similar to normal operators
1971
Pacific Journal of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The first paragraph or two must be capable of being used separately as a synopsis of the entire paper. ...
REMARK The following is a corollary of Lemma 1.
COROLLARY 1. If Stf is a properly infinite von Neumann algebra on ££*, then £/ has a generator which is similar to a self-adjoint operator. Proof. ...
Let C be a self-adjoint generator of c^2 with α (C) properly contained in I 2 . Let λe/ 2 with λgσ(C). ...
doi:10.2140/pjm.1971.37.539
fatcat:fhoqlyq57nct7frz6joa6ggq3m
THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
2016
Journal of Symbolic Logic (JSL)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. ...
These results of definability strength have some interesting consequences in reverse mathematics, including strengthening of known theorems in a more uniform way and also new theorems. ...
Fix Z, X ≤ T Z and (A i : i < ) such that each A i is properly Π Z 1 . Let Y be such that ϕ(X, Y ) and A i ≤ T Z ⊕ Y . Then every A i is properly Π 0 1 in Z ⊕ Y . ...
doi:10.1017/jsl.2016.10
fatcat:kmvvulmqsrbelekjmdiibatliy
On the (di)graphs with (directed) proper connection number two
2019
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The (directed) proper connection number of a given (di)graph G is the least number of colors needed to edge-color G such that there exists a properly colored (di)path between every two vertices in G. ...
We initiate the study of the complexity of computing the proper connection number and (two variants of) the proper vertex connection number, in undirected and directed graphs, respectively. ...
We also intend to study the complexity of computing the proper connection number of bipartite graphs, thereby generalizing the positive result of Theorem 8. A → {1, . . . , k}. ...
doi:10.1016/j.dam.2019.06.024
fatcat:nziyut24endvzfrvlravhfslvy
Page 1754 of Mathematical Reviews Vol. 52, Issue 5
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
From this it follows that the family of vector languages is properly contained in the family of matrix languages ({a"cb"|n20, 1 Sm<2"} is a matrix language whose Parikh map is not semilinear). ...
Since w-regular generalized grammars are known to generate recursive sets only, every van Wijngaarden grammar satisfying the specified condi- tions defines a recursive language. H. ...
Computing Resolution-Path Dependencies in Linear Time
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Since it is generally intractable to determine dependencies exactly, a set of potential dependencies is computed instead, which may include false positives. ...
Dependency schemes provide a general framework for representing such dependencies. ...
In practice one therefore computes an over-approximation of dependencies that may contain false positives. This leads to a trade-off between tractability and generality. ...
arXiv:1202.3097v3
fatcat:d4vbqgtqjvb4vlzn4u6ujo76bu
The Legacy Maturity Level [Binary Critic]
1998
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
T he Y2K bug may turn out to be the least of our problems as computer systems continue to age and turn from information technology (IT) levers into boat anchors. ...
Computers don't wear out and software doesn't rust, yet we spend billions each year to fix, replace, upgrade, and trash perfectly operational systems. ...
In a properly layered software system, every layer connects only to interfaces that are no more than one level above or below it. ...
doi:10.1109/mc.1998.730744
fatcat:czq5sdjo4bfnndowshfwiz5w34
Verifying Generalized Soundness of Workflow Nets
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A model is called sound iff every reachable marking can terminate properly. ...
When computing Υ, we make use of the following observations: (0, . . . , 0, 1, 1) ). Remark 1ī ,f ∈ Υ. Let Υ = Υ \ {ī ,f }. We
Remark 2 Let m be a given marking. ...
doi:10.1007/978-3-540-70881-0_21
fatcat:uhkmsmyouvarjfdvowoozo7ofy
A General Computational Method for Grammar Inversion
[chapter]
1994
Reversible Grammar in Natural Language Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This paper presents a general computational method for automated inversion of a unification-based p~ser for natural language into an efficient generator. ...
A reversible grammar is usually understood as a computational or linguistic system that can be used both for analysis ~nd generation of the language it defines. ...
At this point we may consider a specific linguistic example involving a generalized left-recursive production based on a properly ordered series) 7 [1] sent (V1, V 3,Sem ) :- np(V1,V2,Ssem), vp (V2, V3 ...
doi:10.1007/978-1-4615-2722-0_8
fatcat:dvqb2e7dgrh4npa452q5kfycv4
A collision-free secret ballot protocol for computerized general elections
1996
Computers & security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Our proposed scheme can be used to hold large-scale general elections because it ensures independence among voters without the need for any global computation. ...
In this paper we present a collision-free secret ballot protocol based on the uniquely blmd signature technique. ...
The underlying assumptions of this protocol are: (1) (2) (3) Every voter can communicate with the authority and he must follow the protocol properly. ...
doi:10.1016/0167-4048(96)00011-9
fatcat:75rhdm44cnbztnaciawdhxgjc4
Page 2616 of Mathematical Reviews Vol. , Issue 96e
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Yan proves the following three theorems, where s and ¢ are even integers, s > 0 and t>0: (1) Every [(6g +2) + gs, (6f + 1)t+ fs]-graph is (2g,2f + 1)-factorable. (2) Every [(6g — 1) + gs, (6f —2)t+ fs] ...
- graph is (2g — 1,2/)-factorable. (3) Every [(6g — 1)r + gs, (6f + 1)t + fs]-graph is (2g — 1,2 + 1)-factorable. ...
Detecting a Regularity in the Generation and Utilization of Primes in the Multiplicative Number Theory
2019
Natural Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the multiplicative number theory, covering the positive integers with primes, during the prime factorization, may be viewed as being the outcome of a parallel system which functions properly if and ...
This formula may be implemented using Wolfram's computer package Mathematica. ...
Indeed, the parallel system 1 S properly assigns a prime number to every positive integer larger than 1 and, according to the fundamental theorem of arithmetic, every positive integer larger than 1 is ...
doi:10.4236/ns.2019.116019
fatcat:6n7r7z3huzcfzg2trqrnlvdoti
Page 262 of Mathematical Reviews Vol. 56, Issue 1
[page]
1978
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Systems-Computers-Controls 5 (1974), no. 4, 1-8 (1975).
A generalization of tree generating systems is studied. ...
L, and L, are AFL which contain {a"b"|n2 1}, contains every recursively enumerable set. ...
« Previous
Showing results 1 — 15 out of 619,266 results