On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time release_ihtyixni35hpzp47ohkrd2a2aa

by Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

p300-311

Archived Files and Locations

application/pdf  175.4 kB
file_q7gpeuc4vzf5fgeu2djzbbvqma
web.archive.org (webarchive)
ccc.cs.uni-duesseldorf.de (web)
application/pdf  287.9 kB
file_figalcguynccbex7aiwzzpy77e
web.archive.org (webarchive)
urresearch.rochester.edu (repository)
Read Archived PDF
Archived
Type  chapter
Stage   published
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2463072e-cc9f-4d3d-b86d-fb66e15e3468
API URL: JSON