18 results on '"TARDOS, G."'
Search Results
2. On the boundary complexity of the union of fat triangles.
3. Arthur-Merlin games in Boolean decision trees.
4. A lower bound on the mod 6 degree of the OR function.
5. Multi-prover encoding schemes and three-prover proof systems.
6. The communication complexity of the universal relation.
7. On the power of randomization in online algorithms.
8. A competitive 3-server algorithm.
9. Lower bounds for (MOD p-MOD m) circuits.
10. Decision versus search problems in super-polynomial time.
11. Planning and learning in permutation groups.
12. On the knowledge complexity of /spl Nscr//spl Pscr/.
13. Arthur-Merlin games in Boolean decision trees
14. On the boundary complexity of the union of fat triangles
15. The communication complexity of the universal relation
16. A lower bound on the mod 6 degree of the OR function
17. Lower bounds for (MOD p-MOD m) circuits
18. Agglomeration and defluidization in fluidized beds due to thermally induced sintering
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.