Found 6 Documents (Results 1–6)
A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics. (English) Zbl 1529.68187
Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1682-1701 (2021).
Faster graph coloring in polynomial space. (English) Zbl 1435.68233
Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 371-383 (2017).
MSC:
68R10
Families with infants: speeding up algorithms for NP-hard problems using FFT. (English) Zbl 1445.68163
Filter Results by …
Document Type
- Journal Articles (4)
- Collection Articles (2)
all
top 5
Author
- Nederlof, Jesper (2)
- Pawlewicz, Jakub (2)
- Swennenhuis, Céline M. F. (2)
- Wegrzycki, Karol (2)
- Amini, Omid (1)
- Elkind, Edith (1)
- Fomin, Fedor V. (1)
- Gaspers, Serge (1)
- Golovnev, Alexander (1)
- Jennings, Nicholas R. (1)
- Kulikov, Alexander S. (1)
- Lee, Edward J. (1)
- Michalak, Tomasz P. (1)
- Mihajlin, Ivan (1)
- Rahwan, Talal (1)
- Saurabh, Saket (1)
- Wooldridge, Michael J. (1)
Serial
- Artif. Intell. (1)
- SIAM J. Comput. (1)
- SIAM J. Discrete Math. (1)
- ACM Trans. Algorithms (1)
