Work

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems

Year: 2008

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-540-85958-1_45

Authors: Lars Otten, Rina Dechter

Institution: University of California, Irvine

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1687551056

FWCI: 0.537

Cites: 14

Cited by: 3

Related to: 10