|
|
Venues (Conferences, Journals, ...)
|
|
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 |
54 | Noriyuki Fujimoto, Kenichi Hagihara |
On Approximation of the Bulk Synchronous Task Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(11), pp. 1191-1199, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
software overhead, message packaging, bulk synchronous schedule, approximation, NP-complete, Task scheduling, distributed memory, fine grain, nonapproximability |
54 | Leonard Pitt, Manfred K. Warmuth |
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(1), pp. 95-142, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
minimization of finite state machines, approximation algorithms, nonapproximability |
51 | Martin Thimm |
On the Approximability of the Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 678-689, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Minimum Steiner tree, Gadget reduction, Lower bounds, Approximability |
31 | Haitao Jiang, Jingjing Ma, Junfeng Luan, Daming Zhu |
Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings, pp. 251-263, 2015, Springer, 978-3-319-21397-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
31 | Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis |
Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 20(4), pp. 615-648, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
31 | Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi |
Nonapproximability of the normalized information distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 77(4), pp. 738-742, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
31 | Judy Goldsmith, Christopher Lusena, Martin Mundhenk |
Nonapproximability Results for Partially Observable Markov Decision Processes ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1106.0242, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
31 | Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis |
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 294-303, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Lovász-Schrijver matrix cuts, inapproximability, integrality gaps |
31 | Lars Engebretsen |
The Nonapproximability of Non-Boolean Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 18(1), pp. 114-129, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Mikhail Alecknovich, Sanjeev Arora, Iannis Tourlakis |
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR04, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
31 | Detlef Sieling |
The Nonapproximability of OBDD Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 172(2), pp. 103-138, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Beate Bollig, Martin Sauerhoff, Ingo Wegener |
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 178(1), pp. 263-278, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Christopher Lusena, Judy Goldsmith, Martin Mundhenk |
Nonapproximability Results for Partially Observable Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 14, pp. 83-103, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Christopher Lusena, Judy Goldsmith, Martin Mundhenk |
Nonapproximability Results for Partially Observable Markov Decision Processes ![Search on Bibsonomy](Pics/bibsonomy.png) |
Universität Trier, Mathematik/Informatik, Forschungsbericht ![In: Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
RDF |
|
31 | Oded Goldreich 0001, Shafi Goldwasser |
On the Limits of Nonapproximability of Lattice Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 60(3), pp. 540-563, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Beate Bollig, Ingo Wegener |
Approximability and Nonapproximability by Binary Decision Diagrams ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR00, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
31 | Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger |
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 28(4), pp. 1155-1166, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
31 | Peter Jonsson |
Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 68(5), pp. 249-253, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs, and Nonapproximability-Towards Tight Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 27(3), pp. 804-915, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Peter Jonsson |
A Nonapproximability Result for Finite Function Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 63(3), pp. 143-145, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger |
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pp. 418-426, 1996, ACM, 0-89791-785-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
total flow time, scheduling, approximation algorithm, worst case analysis, release time, single machine |
31 | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor |
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 1995, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
28 | Detlef Sieling |
Minimization Problems for Parity OBDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 44(3), pp. 391-413, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Parity OBDD, Nonapproximability |
28 | Rodolphe Giroudeau, Jean-Claude König |
General Non-Approximability Results in Presence of Hierarchical Communications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC/HeteroPar ![In: 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 3rd International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogenous Networks (HeteroPar 2004), 5-7 July 2004, Cork, Ireland, pp. 312-319, 2004, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hierarchical communications, scheduling, nonapproximability |
28 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs and Non-Approximability - Towards Tight Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 422-431, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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 |
25 | Marek Karpinski |
Approximating Bounded Degree Instances of NP-Hard Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 24-34, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Noga Alon, Richard Beigel |
Lower Bounds for Approximations by Low Degree Polynomials Over Zm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 184-187, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|