Log-Space Polynomial End-to-End Communication

Authors:
Eyal Kushilevitz;Rafail Ostrovsky;Adi Rosén
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
1998

Citing 0
Cited 3

Routing in distributed networks: overview and open problems

ACM SIGACT News
Authenticated Adversarial Routing

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Asynchronous throughput-optimal routing in malicious networks

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded by k, and the number of terms satisfied ...