<?xml version="1.0" encoding="US-ASCII"?>
<rss version="2.0">
<channel><title>dblp: Michael A. Forbes</title><link>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=</link><description>author page RSS feed</description><pubDate>Fri, 17 May 13 21:58:16 +0200</pubDate><lastBuildDate>Thu, 18 Apr 13 21:27:29 +0200</lastBuildDate><language>en-US</language><copyright>released under the ODC-BY 1.0 license</copyright><managingEditor>ley@uni-trier.de (Michael Ley)</managingEditor><webMaster>ley@uni-trier.de (Michael Ley)</webMaster><category>bibliographic meta data</category><docs>http://blogs.law.harvard.edu/tech/rss</docs><image><url>http://www.informatik.uni-trier.de/~ley/img/logo.144x51.png</url><title>dblp: Michael A. Forbes</title><link>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=</link><width>144</width><height>51</height></image><textInput><title>search</title><description>dblp author search</description><link>http://www.informatik.uni-trier.de/~ley/pers/hs</link><name>author</name></textInput><ttl>1440</ttl>
<item><title>Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing</title><link>http://arxiv.org/abs/1303.0084</link><description>Michael A. Forbes, Amir Shpilka: Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1303.html#abs-1303-0084"&gt;CoRR abs/1303.0084&lt;/a&gt; (2013)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/corr/abs-1303-0084</guid><pubDate>2013-04-08</pubDate></item><item><title>Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing.</title><link>http://eccc.hpi-web.de/report/2013/033</link><description>Michael A. Forbes, Amir Shpilka: Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc20.html#ForbesS13"&gt;Electronic Colloquium on Computational Complexity (ECCC) 20&lt;/a&gt;: 33 (2013)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/eccc/ForbesS13</guid><pubDate>2013-04-17</pubDate></item><item><title>On identity testing of tensors, low-rank recovery and compressed sensing.</title><link>http://doi.acm.org/10.1145/2213977.2213995</link><description>Michael A. Forbes, Amir Shpilka: On identity testing of tensors, low-rank recovery and compressed sensing. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/conf/stoc/stoc2012.html#ForbesS12"&gt;STOC 2012&lt;/a&gt;: 163-172</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#conf/stoc/ForbesS12</guid><pubDate>2012-05-22</pubDate></item><item><title>Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs</title><link>http://arxiv.org/abs/1209.2408</link><description>Michael A. Forbes, Amir Shpilka: Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1209.html#abs-1209-2408"&gt;CoRR abs/1209.2408&lt;/a&gt; (2012)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/corr/abs-1209-2408</guid><pubDate>2012-10-10</pubDate></item><item><title>Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs.</title><link>http://eccc.hpi-web.de/report/2012/115</link><description>Michael A. Forbes, Amir Shpilka: Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc19.html#ForbesS12"&gt;Electronic Colloquium on Computational Complexity (ECCC) 19&lt;/a&gt;: 115 (2012)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/eccc/ForbesS12</guid><pubDate>2013-01-14</pubDate></item><item><title>A Survey of Binary Covering Arrays.</title><link>http://www.combinatorics.org/Volume_18/Abstracts/v18i1p84.html</link><description>Jim Lawrence, Raghu Kacker, Yu Lei, D. Richard Kuhn, Michael A. Forbes: A Survey of Binary Covering Arrays. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/combinatorics/combinatorics18.html#LawrenceKLKF11"&gt;Electr. J. Comb. 18&lt;/a&gt;(1) (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/combinatorics/LawrenceKLKF11</guid><pubDate>2012-09-11</pubDate></item><item><title>Tensor Rank: Some Lower and Upper Bounds.</title><link>http://dx.doi.org/10.1109/CCC.2011.28</link><description>Boris Alexeev, Michael A. Forbes, Jacob Tsimerman: Tensor Rank: Some Lower and Upper Bounds. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/conf/coco/coco2011.html#AlexeevFT11"&gt;IEEE Conference on Computational Complexity 2011&lt;/a&gt;: 283-291</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#conf/coco/AlexeevFT11</guid><pubDate>2011-08-12</pubDate></item><item><title>Tensor Rank: Some Lower and Upper Bounds</title><link>http://arxiv.org/abs/1102.0072</link><description>Boris Alexeev, Michael A. Forbes, Jacob Tsimerman: Tensor Rank: Some Lower and Upper Bounds &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1102.html#abs-1102-0072"&gt;CoRR abs/1102.0072&lt;/a&gt; (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/corr/abs-1102-0072</guid><pubDate>2011-12-05</pubDate></item><item><title>Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant</title><link>http://arxiv.org/abs/1104.4557</link><description>Michael A. Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha: Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1104.html#abs-1104-4557"&gt;CoRR abs/1104.4557&lt;/a&gt; (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/corr/abs-1104-4557</guid><pubDate>2012-09-11</pubDate></item><item><title>Improved Soundness for QMA with Multiple Provers</title><link>http://arxiv.org/abs/1108.2098</link><description>Alessandro Chiesa, Michael A. Forbes: Improved Soundness for QMA with Multiple Provers &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1108.html#abs-1108-2098"&gt;CoRR abs/1108.2098&lt;/a&gt; (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/corr/abs-1108-2098</guid><pubDate>2012-09-11</pubDate></item><item><title>On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing</title><link>http://arxiv.org/abs/1111.0663</link><description>Michael A. Forbes, Amir Shpilka: On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1111.html#abs-1111-0663"&gt;CoRR abs/1111.0663&lt;/a&gt; (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/corr/abs-1111-0663</guid><pubDate>2011-12-05</pubDate></item><item><title>Tensor Rank: Some Lower and Upper Bounds.</title><link>http://eccc.hpi-web.de/report/2011/010</link><description>Boris Alexeev, Michael A. Forbes, Jacob Tsimerman: Tensor Rank: Some Lower and Upper Bounds. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc18.html#AlexeevFT11"&gt;Electronic Colloquium on Computational Complexity (ECCC) 18&lt;/a&gt;: 10 (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/eccc/AlexeevFT11</guid><pubDate>2011-12-07</pubDate></item><item><title>Improved Soundness for QMA with Multiple Provers.</title><link>http://eccc.hpi-web.de/report/2011/110</link><description>Alessandro Chiesa, Michael A. Forbes: Improved Soundness for QMA with Multiple Provers. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc18.html#ChiesaF11"&gt;Electronic Colloquium on Computational Complexity (ECCC) 18&lt;/a&gt;: 110 (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/eccc/ChiesaF11</guid><pubDate>2012-09-11</pubDate></item><item><title>On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing.</title><link>http://eccc.hpi-web.de/report/2011/147</link><description>Michael A. Forbes, Amir Shpilka: On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. &lt;a href="http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc18.html#ForbesS11"&gt;Electronic Colloquium on Computational Complexity (ECCC) 18&lt;/a&gt;: 147 (2011)</description><guid>http://www.informatik.uni-trier.de/~ley/pers/hd/f/Forbes:Michael_A=.html#journals/eccc/ForbesS11</guid><pubDate>2011-12-07</pubDate></item></channel></rss>