- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Derandomizing Arthur–Merlin Games using Hitting Sets ; volume:14 ; number:3 ; pages:256-279 ; date:12.2005
Computational complexity ; 14, Heft 3, 256-279, 12.2005
- Creator
-
Miltersen, Peter Bro
Vinodchandran, N. V.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-005-0197-7
- URN
-
urn:nbn:de:101:1-2021080918560387415006
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:47 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Miltersen, Peter Bro
- Vinodchandran, N. V.
- SpringerLink (Online service)
Other Objects (12)
Quantum Arthur–Merlin games
Dynamic Kernels for Hitting Sets and Set Packing
EV hitting sets in road networks
Optimal drug combinations and minimal hitting sets
FPT algorithms for diverse collections of hitting sets
Compression with wildcards: All exact or all minimal hitting sets
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Mixed hitting-time models
Mixed Hitting-Time Models
Hitting the Right Person
Hitting hyperbolic half-space
Quantum Arthur–Merlin games
Dynamic Kernels for Hitting Sets and Set Packing
EV hitting sets in road networks
Optimal drug combinations and minimal hitting sets
FPT algorithms for diverse collections of hitting sets
Compression with wildcards: All exact or all minimal hitting sets
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Mixed hitting-time models
Mixed Hitting-Time Models
Hitting the Right Person
Hitting hyperbolic half-space
Quantum Arthur–Merlin games
Dynamic Kernels for Hitting Sets and Set Packing
EV hitting sets in road networks
Optimal drug combinations and minimal hitting sets
FPT algorithms for diverse collections of hitting sets
Compression with wildcards: All exact or all minimal hitting sets
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Mixed hitting-time models
Mixed Hitting-Time Models
Hitting the Right Person