Author:
Burgarth Daniel,Giovannetti Vittorio,Hogben Leslie,Severini Simone,Young Michael
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference17 articles.
1. Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, University of Waterloo
2. Alon N, Boppana R (1986) The monotone circuit complexity of Boolean functions. Combinatorica 7:1–22
3. American Institute of Mathematics (AIM) Minimum Rank-Special GraphsWork Group, Barioli F, Barrett W, Butler S, Cioabă SM, Cvetković D, Fallat SM, Godsil C, Haemers W, Hogben L, Mikkelson R, Narayan S, Pryporova O, Sciriha I, So W, Stevanović D, van der Holst H, Vander Meulen K, Wangsness A (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628–1648
4. Astola J, Akopian D, Vainio O, Agaian S (1997) New digit-serial implementation of stack filters. Discrete Appl Math 61:181–197
5. Burgarth D, Giovannetti V (2007) Full control by locally induced relaxation. Phys Rev Lett 99:100501. arXiv:0704.3027 [quant-ph]
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献