BibSonomy publications for /author/Melkebeek http://www.bibsonomy.org/author/Melkebeek BibSonomy RSS Feed for /author/Melkebeek A Survey of Lower Bounds for Satisfiability and Related Problems. dblp http://www.bibsonomy.org/bibtex/245f67ebc1272e5d49bcee45a8a534745/dblp dblp 2008-05-20T00:00:00+02:00 dblp
A Survey of Lower Bounds for Satisfiability and Related Problems.
Dieter van Melkebeek Foundations and Trends in Theoretical Computer Science 2 197-303 (2006)
to dblp by dblp on 2008-05-20 00:00:00
]]> On the Complexity of Numerical Analysis. dblp http://www.bibsonomy.org/bibtex/26d4074dfcc2bcbf788f49eac3cfea047/dblp dblp 2008-05-14T00:00:00+02:00 dblp
On the Complexity of Numerical Analysis.
Eric Allender and Peter Bürgisser and Johan Kjeldgaard-Pedersen and Peter Bro Miltersen Complexity of Boolean Functions (2006)
to dblp by dblp and 1 other person on 2008-05-14 00:00:00
]]> 06111 Executive Summary -- Complexity of Boolean Functions. dblp http://www.bibsonomy.org/bibtex/2145cc2c534abb0eb54d7e041967a80b2/dblp dblp 2008-05-14T00:00:00+02:00 dblp
06111 Executive Summary -- Complexity of Boolean Functions.
Matthias Krause and Dieter van Melkebeek and Pavel Pudlák and Rüdiger Reischuk Complexity of Boolean Functions (2006)
to dblp by dblp on 2008-05-14 00:00:00
]]> Approximability of Minimum AND-Circuits. dblp http://www.bibsonomy.org/bibtex/27fb19cb1d34655d598034e9390c97952/dblp dblp 2008-05-14T00:00:00+02:00 dblp
Approximability of Minimum AND-Circuits.
Jan Arpe and Bodo Manthey Complexity of Boolean Functions (2006)
to dblp by dblp and 1 other person on 2008-05-14 00:00:00
]]> Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. dblp http://www.bibsonomy.org/bibtex/2c6b78c02a3eff51d2bca8b9e249ea8a1/dblp dblp 2008-05-14T00:00:00+02:00 dblp
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.
Andreas Jakoby and Till Tantau Complexity of Boolean Functions (2006)
to dblp by dblp on 2008-05-14 00:00:00
]]> A Generic Time Hierarchy for Semantic Models With One Bit of Advice. dblp http://www.bibsonomy.org/bibtex/27eedd4f69aa1a5a4a709257403ae03fc/dblp dblp 2008-05-14T00:00:00+02:00 dblp
A Generic Time Hierarchy for Semantic Models With One Bit of Advice.
Dieter van Melkebeek and Konstantin Pervyshev Complexity of Boolean Functions (2006)
to dblp by dblp and 1 other person on 2008-05-14 00:00:00
]]> The optimal sequence compression. dblp http://www.bibsonomy.org/bibtex/27b9e8a6b41210d6c3aaff5dd2f5e5b60/dblp dblp 2008-05-14T00:00:00+02:00 dblp
The optimal sequence compression.
Alexander E. Andreev Complexity of Boolean Functions (2006)
to dblp by dblp on 2008-05-14 00:00:00
]]> Quantum vs. Classical Read-Once Branching Programs. dblp http://www.bibsonomy.org/bibtex/29baa0ddfd4d3a7e3c3e6b7c409e65ea6/dblp dblp 2008-05-14T00:00:00+02:00 dblp
Quantum vs. Classical Read-Once Branching Programs.
Martin Sauerhoff Complexity of Boolean Functions (2006)
to dblp by dblp on 2008-05-14 00:00:00
]]> Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. dblp http://www.bibsonomy.org/bibtex/2de17f5290cac56a0d7a83aa63d1ae5b3/dblp dblp 2008-05-14T00:00:00+02:00 dblp
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Andreas Jakoby and Maciej Liskiewicz and Aleksander Madry Complexity of Boolean Functions (2006)
to dblp by dblp and 1 other person on 2008-05-14 00:00:00
]]> Incremental branching programs. dblp http://www.bibsonomy.org/bibtex/28c067018bb5273887791470e69ef6cda/dblp dblp 2008-05-14T00:00:00+02:00 dblp
Incremental branching programs.
Anna Gál and Pierre McKenzie and Michal Koucký Complexity of Boolean Functions (2006)
to dblp by dblp and 1 other person on 2008-05-14 00:00:00
]]>