Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for NPPP with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1997 (1) 2000 (1) 2003 (1) 2006 (1) 2024 (1)
Publication types (Num. hits)
article(3) inproceedings(2)
Venues (Conferences, Journals, ...)
ACM Trans. Comput. Log.(2) AAMAS(1) J. ACM(1) MFCS(1)
Authors
Eric Allender(2) Judy Goldsmith(2) Martin Mundhenk(2) Christopher Lusena(1) Fabrizio Angiulli(1) Giovambattista Ianni(1) Joanna Kaczmarek 0001(1) Jörg Rothe(1) Luigi Palopoli 0001(1) Paolo Liberatore(1) Rachel Ben-Eliyahu-Zohary(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 10 keywords
Results
Found 5 publication records. Showing 5 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
63Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender Complexity of finite-horizon Markov decision process problems. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF NPPP, computational complexity, Markov decision processes, NP, PL, partially observable Markov decision processes, PSPACE, succinct representations
46Joanna Kaczmarek 0001, Jörg Rothe NPPP-Completeness of Control by Adding Players to Change the Penrose-Banzhaf Power Index in Weighted Voting Games. Search on Bibsonomy AAMAS The full citation details ... 2024 DBLP  BibTeX  RDF
26Paolo Liberatore Complexity results on DPLL and resolution. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Davis-Putnam, NP-completeness, propositional satisfiability
26Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli 0001 Computational properties of metaquerying problems. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF data mining, Computational complexity
26Martin Mundhenk, Judy Goldsmith, Eric Allender The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. Search on Bibsonomy MFCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #5 of 5 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license