The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1993-2001 (15) 2002-2015 (12)
Publication types (Num. hits)
article(19) inproceedings(8)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 30 occurrences of 23 keywords

Results
Found 27 publication records. Showing 27 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
54Noriyuki Fujimoto, Kenichi Hagihara On Approximation of the Bulk Synchronous Task Scheduling Problem. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF software overhead, message packaging, bulk synchronous schedule, approximation, NP-complete, Task scheduling, distributed memory, fine grain, nonapproximability
54Leonard Pitt, Manfred K. Warmuth The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF minimization of finite state machines, approximation algorithms, nonapproximability
51Martin Thimm On the Approximability of the Steiner Tree Problem. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Minimum Steiner tree, Gadget reduction, Lower bounds, Approximability
31Haitao Jiang, Jingjing Ma, Junfeng Luan, Daming Zhu Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem. Search on Bibsonomy COCOON The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
31Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. Search on Bibsonomy Comput. Complex. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
31Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi Nonapproximability of the normalized information distance. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
31Judy Goldsmith, Christopher Lusena, Martin Mundhenk Nonapproximability Results for Partially Observable Markov Decision Processes Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
31Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Lovász-Schrijver matrix cuts, inapproximability, integrality gaps
31Lars Engebretsen The Nonapproximability of Non-Boolean Predicates. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Mikhail Alecknovich, Sanjeev Arora, Iannis Tourlakis Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2004 DBLP  BibTeX  RDF
31Detlef Sieling The Nonapproximability of OBDD Minimization. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
31Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
31Christopher Lusena, Judy Goldsmith, Martin Mundhenk Nonapproximability Results for Partially Observable Markov Decision Processes. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
31Christopher Lusena, Judy Goldsmith, Martin Mundhenk Nonapproximability Results for Partially Observable Markov Decision Processes Search on Bibsonomy Universität Trier, Mathematik/Informatik, Forschungsbericht The full citation details ... 2000   RDF
31Oded Goldreich 0001, Shafi Goldwasser On the Limits of Nonapproximability of Lattice Problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
31Beate Bollig, Ingo Wegener Approximability and Nonapproximability by Binary Decision Diagrams Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2000 DBLP  BibTeX  RDF
31Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
31Peter Jonsson Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
31Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 Free Bits, PCPs, and Nonapproximability-Towards Tight Results. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
31Peter Jonsson A Nonapproximability Result for Finite Function Generation. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
31Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. Search on Bibsonomy STOC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF total flow time, scheduling, approximation algorithm, worst case analysis, release time, single machine
31Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Search on Bibsonomy Chic. J. Theor. Comput. Sci. The full citation details ... 1995 DBLP  BibTeX  RDF
28Detlef Sieling Minimization Problems for Parity OBDDs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Parity OBDD, Nonapproximability
28Rodolphe Giroudeau, Jean-Claude König General Non-Approximability Results in Presence of Hierarchical Communications. Search on Bibsonomy ISPDC/HeteroPar The full citation details ... 2004 DBLP  DOI  BibTeX  RDF hierarchical communications, scheduling, nonapproximability
28Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 Free Bits, PCPs and Non-Approximability - Towards Tight Results. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability
25Marek Karpinski Approximating Bounded Degree Instances of NP-Hard Problems. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
25Noga Alon, Richard Beigel Lower Bounds for Approximations by Low Degree Polynomials Over Zm. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #27 of 27 (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