Titlebook: Automata, Languages and Programming; Eighth Colloquium, A Shimon Even,Oded Kariv Conference proceedings 1981 Springer-Verlag Berlin Heidelb

連結(jié)

書目名稱Automata, Languages and Programming影響因子(影響力)




書目名稱Automata, Languages and Programming影響因子(影響力)學科排名




書目名稱Automata, Languages and Programming網(wǎng)絡公開度




書目名稱Automata, Languages and Programming網(wǎng)絡公開度學科排名




書目名稱Automata, Languages and Programming被引頻次




書目名稱Automata, Languages and Programming被引頻次學科排名




書目名稱Automata, Languages and Programming年度引用




書目名稱Automata, Languages and Programming年度引用學科排名




書目名稱Automata, Languages and Programming讀者反饋




書目名稱Automata, Languages and Programming讀者反饋學科排名

驕傲

Getting Started with Containers in AzureLet F be a n-variate polynomial with deg F = d over an infinite field k.. Absolute primality of F can be decided randomly in time polynomial in n and exponential in d. and determinalistically in time exponential in d. + n. d..

偏離

咒語

https://doi.org/10.1007/978-1-4842-8045-4We shall briefly survey what the author believes are some of the most fruitful directions in relational database theory. These directions include dependency inferences, support for the universal relation concept, null value semantics, and an exploration of the properties of acyclic database schemes.

CHIDE

調(diào)味品

Absolute primality of polynomials is decidable in random polynomial time in the number of variablesLet F be a n-variate polynomial with deg F = d over an infinite field k.. Absolute primality of F can be decided randomly in time polynomial in n and exponential in d. and determinalistically in time exponential in d. + n. d..

encomiast

Algorithmic specifications of abstract data types,A new method for the specification of abstract data types is presented. Being algorithmic it avoids several difficulties of the algebraic specification method.

jabber

A view of directions in relational database theory,We shall briefly survey what the author believes are some of the most fruitful directions in relational database theory. These directions include dependency inferences, support for the universal relation concept, null value semantics, and an exploration of the properties of acyclic database schemes.

倔強一點

Proponent

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166209.jpg