Search results for: Dieter Melkebeek
Lecture Notes in Computer Science > Randomness and Completeness in Computational Complexity > 113-140
Lecture Notes in Computer Science > Randomness and Completeness in Computational Complexity > 141-144
Lecture Notes in Computer Science > STACS 98 > 161-171
Lecture Notes in Computer Science > Computing and Combinatorics > Complexity and Computability > 429-438
Lecture Notes in Computer Science > Randomness and Completeness in Computational Complexity > 145-159
Lecture Notes in Computer Science > Automata, Languages and Programming > Session B5: Logic in Computer Science > 368-379
Lecture Notes in Computer Science > Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques > Contributed Talks of RANDOM > 574-587
Lecture Notes in Computer Science > Automata, Languages and Programming > Contributed Papers > 971-982
Lecture Notes in Computer Science > STACS 2000 > 407-418
Lecture Notes in Computer Science > Randomness and Completeness in Computational Complexity > 161-181
Lecture Notes in Computer Science > Randomness and Completeness in Computational Complexity > 77-112
Lecture Notes in Computer Science
computational complexity > 2015 > 24 > 4 > 695-776
computational complexity > 2017 > 26 > 1 > 79-118
computational complexity > 2013 > 22 > 2 > 345-383