- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Miltersen, Peter Bro
Vinodchandran, N. V.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-005-0197-7
- URN
-
urn:nbn:de:101:1-2021080918560387415006
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:47 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Miltersen, Peter Bro
- Vinodchandran, N. V.
- SpringerLink (Online service)
Ähnliche Objekte (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