首页>外文会议>Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

召开年：
召开地：St. Louis, MO
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.The mixing rate of Markov chains, an isoperimetric inequality, andcomputing the volume

机译：马尔可夫链的混合率，等距不等式和计算音量
- 作者：Lovasz L.;Simonovits M.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
2.A characterization of #P by arithmetic straight line programs

机译：用算术直线程序表征#P
- 作者：Babai L.;Fortnow L.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
3.Parallel linear programming in fixed dimension almost surely inconstant time

机译：几乎可以肯定地在固定尺寸上进行并行线性编程恒定时间
- 作者：Alon N.;Megiddo N.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
4.Faster circuits and shorter formulae for multiple addition,multiplication and symmetric Boolean functions

机译：更快的电路和更短的公式来进行多次加法运算，乘法和对称布尔函数
- 作者：Paterson M.S.;Pippenger N.;Zwick U.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
5.Tight bounds on the complexity of cascaded decomposition ofautomata

机译：关于级联分解的复杂性的严格界限自动机
- 作者：Maler O.;Pnueli A.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
6.Asymptotically tight bounds for computing with faulty arrays ofprocessors

机译：用的有错数组计算的渐近紧边界。处理器
- 作者：Kaklamanis C.;Karlin A.R.;Leighton F.T.;Milenkovic V.;Raghavan P.;Rao S.;Thomborson C.;Tsantilas A.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
7.A tree-partitioning technique with applications to expressionevaluation and term matching

机译：树分割技术及其在表达中的应用评估和术语匹配
- 作者：Kosaraju S.R.;Delcher A.L.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
8.Multiple non-interactive zero knowledge proofs based on a singlerandom string

机译：基于单个的多个非交互式零知识证明随机字符串
- 作者：Feige U.;Lapidot D.;Shamir A.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
9.Competitive k-server algorithms

机译：竞争性 k-服务器算法
- 作者：Fiat A.;Rabani Y.;Ravid Y.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
10.Simple construction of almost k-wise independent randomvariables

机译：几乎 k 位独立随机变量的简单构造变数
- 作者：Alon N.;Goldreich O.;Hastad J.;Peralta R.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
11.An approach for proving lower bounds: solution of Gilbert-Pollak'sconjecture on Steiner ratio

机译：证明下界的一种方法：Gilbert-Pollak的解决方案关于斯坦纳比的猜想
- 作者：Du D.-Z.;Hwang F.K.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
12.Efficient parallel algorithms for tree-decomposition and relatedproblems

机译：高效的树分解并行算法及相关算法问题
- 作者：Lagergren J.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
13.Exact identification of circuits using fixed points ofamplification functions

机译：使用固定点精确识别电路放大功能
- 作者：Goldman S.A.;Kearns M.J.;Schapire R.E.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
14.Nondeterministic exponential time has two-prover interactiveprotocols

机译：非确定性指数时间具有两个证明者的交互作用协议
- 作者：Babai L.;Fortnow L.;Lund C.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
15.Constructing generalized universal traversing sequences ofpolynomial size for graphs with small diameter

机译：构造广义的通用遍历序列小直径图的多项式大小
- 作者：Istrail S.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
16.Simplifying nested radicals and solving polynomials by radicals inminimum depth

机译：简化嵌套的部首，并通过部首中的部首求解多项式最小深度
- 作者：Horng G.;Huang M.-D.A.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
17.Trans-dichotomous algorithms for minimum spanning trees andshortest paths

机译：最小生成树的跨二分算法和最短路径
- 作者：Fredman M.L.;Willard D.E.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
18.Reducing the parallel complexity of certain linear programmingproblems

机译：降低某些线性编程的并行复杂度问题
- 作者：Vaidya P.M.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
19.Interpolation of sparse rational functions without knowing boundson exponents

机译：稀疏有理函数的插值而不知道边界在指数上
- 作者：Grigoriev D.Y.;Karpinski M.;Singer M.F.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
20.On the complexity of learning from counterexamples and membershipqueries

机译：从反例和成员资格中学习的复杂性查询
- 作者：Maass W.;Turan G.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
21.Separating distribution-free and mistake-bound learning models overthe Boolean domain

机译：将无分布和错误错误的学习模型分开布尔域
- 作者：Blum A.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
22.Proceedings. 31st Annual Symposium on Foundations of ComputerScience (Cat. No.90CH2925-6)

机译：议事录。第31届计算机基础年度研讨会科学（货号90CH2925-6）
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
23.On interpolation by analytic functions with special properties andsome weak lower bounds on the size of circuits with symmetric gates

机译：关于具有特殊性质的解析函数的插值具有对称门的电路尺寸的一些弱下限
- 作者：Smolensky R.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》
24.IP=PSPACE interactive proof=polynomial space

机译：IP = PSPACE 交互式证明=多项式空间
- 作者：Shamir A.
- 会议名称：《Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on》