Work

Non-Adaptive Learning a Hidden Hipergraph

Year: 2015

Type: preprint

Abstract: We give a new deterministic algorithm that non-adaptively learns a hidden hypergraph from edge-detecting queries. All previous non-adaptive algorithms either run in exponential time or have non-optimal query complexity. We give the first polynomial time non-adaptive learning algorithm for learning hypergraph that asks almost optimal number of queries.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1502.04137

Authors: Abasi, Hasan, Bshouty, Nader H., Mazzawi, Hanna

Institutions: Technion – Israel Institute of Technology, Google (United Kingdom)

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2950852191

Cites: 24

Cited by: 1

Related to: 20