On approximating the permanent and other #p-complete problems | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

On approximating the permanent and other #p-complete problems

Identifier:nobleid.org/w1/20260515/F4B02BBA

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/F4B02BBA.svg?ark=w1%2F20260515%2FF4B02BBA)](https://nobleid.org/work/w1/20260515/F4B02BBA)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Lars Eilstrup Rasmussen

Alistair Sinclair

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy