Zobrazeno 1 - 7
of 7
pro vyhledávání: '"PINYAN LU"'
Publikováno v:
Linear Algebra and its Applications. 438:690-707
We introduce Fibonacci gates as a polynomial time computable primitive, and develop a theory of holographic algorithms based on these gates. The Fibonacci gates play the role of matchgates in Valiant’s theory (Valiant (2008) [19]). They give rise t
Autor:
Jin-Yi Cai, Pinyan Lu
Publikováno v:
Theory of Computing Systems. 46:398-415
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmetric signatures over all bases of size 1. These improve previous results by Cai and Choudhary (ICALP 2006, vol. 4051, pp.
Autor:
Jin-Yi Cai, Pinyan Lu
Publikováno v:
computational complexity. 17:254-281
Holographic algorithms are a novel approach to design polynomial time computations using linear superpositions. Most holographic algorithms are designed with basis vectors of dimension 2. Recently Valiant showed that a basis of dimension 4 can be use
Autor:
Jin-Yi Cai, Pinyan Lu
Publikováno v:
Algorithms and Computation ISBN: 9783540921813
ISAAC
ISAAC
Valiant initiated a theory of holographic algorithms based on perfect matchings. These algorithms express computations in terms of signatures realizable by matchgates. We substantially develop the signature theory in terms of d-realizability and d-ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::223db3007a3ea85852adef1e37112900
https://doi.org/10.1007/978-3-540-92182-0_51
https://doi.org/10.1007/978-3-540-92182-0_51
Autor:
Pinyan Lu, Jin-Yi Cai
Publikováno v:
IEEE Conference on Computational Complexity
Holographic algorithms are a novel approach to design polynomial time computations using linear superpositions. Most holographic algorithms are designed with basis vectors of dimension 2. Recently Valiant showed that a basis of dimension 4 can be use
Autor:
Jin-Yi Cai, Pinyan Lu
Publikováno v:
STACS 2007 ISBN: 9783540709176
STACS
STACS
In holographic algorithms, symmetric signatures have been particularly useful.We give a complete characterization of these symmetric signatures over all bases of size 1. These improve previous results [4] where only symmetric signatures over the Hada
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fe79ad9098fd626a96dd1b36e8d7b5a
https://doi.org/10.1007/978-3-540-70918-3_37
https://doi.org/10.1007/978-3-540-70918-3_37
Autor:
Jin-Yi Cai, Pinyan Lu
Publikováno v:
STOC
We develop the theory of holographic algorithms initiated by Leslie Valiant. First we define a basis manifold. Then we characterize algebraic varieties of realizable symmetric generators and recognizers on the basis manifold, and give a polynomial ti