Results 261 to 270 of about 49,616 (309)
Some of the next articles are maybe not open access.
Generic oracles and oracle classes
28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 1987In this paper, we examine various complexity issues relative to an oracle for a generic set in order to determine which are the more "natural" conjectures for these issues. Generic oracle results should be viewed as parallels to random oracle results, as in [BG]; the two are in many ways related, but, as we shall exhibit, not equivalent.
Manuel Blum, Russell Impagliazzo
openaire +1 more source
Decision Oracles are Equivalent to Matching Oracles
1999One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separation or reduction arguments are the basic means for this classification.
Helena Handschuh +2 more
openaire +1 more source
2006
We describe a general way of building logics with Lindstrom quantifiers, which capture regular complexity classes on ordered structures with polysize reductions. We then extend this method so as to accommodate complexity classes based on oracle Turing machines.
Johann A. Makowsky, Y. B. Pnueli
openaire +1 more source
We describe a general way of building logics with Lindstrom quantifiers, which capture regular complexity classes on ordered structures with polysize reductions. We then extend this method so as to accommodate complexity classes based on oracle Turing machines.
Johann A. Makowsky, Y. B. Pnueli
openaire +1 more source
Sci. Ann. Cuza Univ., 1993
Summary: We define a class of grammars with regulated rewriting based on the idea of oracles: certain nonterminals act as ``bifurcation symbols'', having associated language oracles; if the left/right neighbouring (maximal) terminal string for a given symbol belongs to the corresponding oracle, then a precisely identified nonterminal is produced ...
Lila Kari +3 more
openaire +1 more source
Summary: We define a class of grammars with regulated rewriting based on the idea of oracles: certain nonterminals act as ``bifurcation symbols'', having associated language oracles; if the left/right neighbouring (maximal) terminal string for a given symbol belongs to the corresponding oracle, then a precisely identified nonterminal is produced ...
Lila Kari +3 more
openaire +1 more source
2006
Combining two well-known techniques – pushdown automata and oracles – results in a new class of parsers (oracle pushdown automata) having many advantages It makes possible to combine easily different parsing techniques handling different language aspects into a single parser Such composition moreover preserves simplicity of design of the combined parts
openaire +1 more source
Combining two well-known techniques – pushdown automata and oracles – results in a new class of parsers (oracle pushdown automata) having many advantages It makes possible to combine easily different parsing techniques handling different language aspects into a single parser Such composition moreover preserves simplicity of design of the combined parts
openaire +1 more source
ACM SIGGRAPH ASIA 2008 computer animation festival, 2008
Flavien Lens +3 more
openaire +1 more source
Flavien Lens +3 more
openaire +1 more source
Towards better long-tailed oracle character recognition with adversarial data augmentation
Pattern Recognition, 2023Qiu-Feng Wang +2 more
exaly
Connect API with Blockchain: A Survey on Blockchain Oracle Implementation
ACM Computing Surveys, 2023Amirmohammad Pasdar +2 more
exaly
Oracle GoldenGate for Non-Oracle Databases
2016Oracle GoldenGate is capable of capturing and delivering data between a variety of relational, open systems and legacy databases on major platforms.
openaire +1 more source