414 search results - page 2 / 83 » On discrete norms of polynomials |
IANDC
2010
13 years 8 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
TOC
2008
13 years 9 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
COCO
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
AUTOMATICA
2005
13 years 9 months ago
2005
In this paper, the problem of fault detection in sampled-data systems is studied. It is shown that norms of a sampled system are equal to the corresponding norms of a certain disc...