A Note on Non-Deterministic Communication Complexity with Few Witnesses.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 4, p. 387, doi. 10.1007/s00224-003-1158-7
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2003 AND VI 36 AND IP 4
Results: 5
1
2
Arithmetic Complexity, Kleene Closure, and Formal Power Series<!-- RID="*"--><!-- ID="*" SOME OF THIS WORK WAS PERFORMED WHILE THE FIRST AUTHOR WAS A VISITING SCHOLAR AT THE INSTITUTE OF MATHEMATICAL SCIENCES, CHENNAI, INDIA. SUPPORTED IN PART BY NSF...
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 4, p. 303, doi. 10.1007/s00224-003-1077-7
- By:
- Publication type:
- Article
3
Dynamic Generation of Discrete Random Variates.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 4, p. 329, doi. 10.1007/s00224-003-1078-6
- By:
- Publication type:
- Article
4
The (Non)Enumerability of the Determinant and the Rank<!-- RID="*"--><!-- ID="*" THE FIRST AUTHOR WAS SUPPORTED IN PART BY GRANTS NSF-DUE-9980943, NIH-RO1-AG18231, NIH-P30-AG18254, AND AN ALZHEIMER'S ASSOCIATION GRANT PIO-1999-1519. -->.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 4, p. 359, doi. 10.1007/s00224-003-1091-9
- By:
- Publication type:
- Article
5
Exact Complexity of the Winner Problem for Young Elections<!-- RID="*"-->.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 4, p. 375, doi. 10.1007/s00224-002-1093-z
- By:
- Publication type:
- Article