WORD LENGTH OF POLYNOMIAL FUNCTIONS ON LATTICES

被引：1

作者：

DORNINGER, D ^{[1
]}

机构：

[1] TH VIENNA, INST MATH, VIENNA 1040, AUSTRIA

来源：

MONATSHEFTE FUR MATHEMATIK | 1973年 / 77卷 / 02期

关键词：

D O I：

10.1007/BF01295042

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：97 / 104

页数：8

共 50 条

[21] POLYNOMIAL AUTOMORPHISMS OF LATTICES
FRIED, E
LAKSER, H
ALGEBRA UNIVERSALIS, 1990, 27 (03) : 371 - 384
[22] Modular Equivalence Verification of Polynomial Datapaths with Multiple Word-Length Operands
Alizadeh, Bijan
Fujita, Masahiro
2011 IEEE INTERNATIONAL HIGH LEVEL DESIGN VALIDATION AND TEST WORKSHOP (HLDVT), 2011, : 9 - 16
[23] Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R.L. Goodstein
Couceiro, Miguel
Waldhauser, Tamas
ALGEBRA UNIVERSALIS, 2013, 69 (03) : 287 - 299
[24] A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length
Kane, Daniel M.
2014 IEEE 29TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2014, : 217 - 228
[25] Coefficient sensitivity of polynomial-predictive FIR differentiators: Design for short word length
Tanskanen, JMA
Ovaska, SJ
42ND MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, PROCEEDINGS, VOLS 1 AND 2, 1999, : 520 - 523
[26] Lattices in graphs with polynomial growth
Lukacs, A
Seifter, N
DISCRETE MATHEMATICS, 1998, 186 (1-3) : 227 - 236
[27] POLYNOMIAL ENUMERATION OF MULTIDIMENSIONAL LATTICES
LEW, JS
MATHEMATICAL SYSTEMS THEORY, 1979, 12 (03): : 253 - 270
[28] Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R. L. Goodstein
Miguel Couceiro
Tamás Waldhauser
Algebra universalis, 2013, 69 : 287 - 299
[29] THE WORD AND GENERATOR PROBLEMS FOR LATTICES
COSMADAKIS, SS
INFORMATION AND COMPUTATION, 1988, 77 (03) : 192 - 217
[30] Shallow parsing on word lattices
Zaborowski, Bartosz
2014 XXII ANNUAL PACIFIC VOICE CONFERENCE (PVC), 2014,

← 1 2 3 4 5 →