„Counting Problems“

Suchergebnisse

1.000+ Treffer

• Kernelization of Counting Problems
  Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket ; Zehavi, Meirav 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Numerical Stability Problems in the K0-Standardization Method for the Case of Short Irradiation and Counting Times
  Jaćimović, R. ; Trkov, A.
• Learning Aggregate Queries Defined by First-Order Logic with Counting
  Bergerem, Steffen ˜vanœ ; Schweikardt, Nicole 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Learning Concepts Described By Weight Aggregation Logic
  Bergerem, Steffen ˜vanœ ; Schweikardt, Nicole 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Range Counting Oracles for Geometric Problems
  Driemel, Anne ; Monemizadeh, Morteza ; Oh, Eunjin ; Staals, Frank ; Woodruff, David P. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tropical Geometric Counting Problems
  Geiger, Alheydis ; Markwig, Hannah 2022 Universitätsbibliothek Tübingen
• Some counting problems in graphs
  Mohr, Elena 2021 Universität Ulm
• Counting Problems on Quantum Graphs – Parameterized and Exact Complexity Classifications
  Roth, Marc ; Dell, Holger 2019 Saarländische Universitäts- und Landesbibliothek
• Statistical analysis methods for time varying nanoscale imaging problems
  Laitenberger, Oskar ; Egner, Alexander ; Salditt, Tim 2019 Niedersächsische Staats- und Universitätsbibliothek Göttingen
• Realization and counting problems for planar structures – trees and linkages, polytopes and polyominoes
  Ribó Mor, Ares
• TO TEACH COMBINATORICS, USING SELECTED PROBLEMS
  Modan, Laurentiu 2012 Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
• A Panorama of Discrepancy Theory
  Chen, William ; Srivastav, Anand ; Travaglini, Giancarlo 2014 Springer International Publishing
• Solving Partial Dominating Set and Related Problems Using Twin-Width
  Balabán, Jakub ; Mock, Daniel ; Rossmanith, Peter 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ACM bundles, quintic threefolds and counting problems
  Mohan Kumar, N. ; Rao, Aroor
• Moduli spaces of Abelian differentials: The principal boundary, counting problems, and the Siegel–Veech constants
  Eskin, Alex ; Masur, Howard ; Zorich, Anton
• P-Time Algorithms for Typical #EO Problems
  Meng, Boning ; Wang, Juqiu ; Xia, Mingji 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterised Holant Problems
  Aivasiliotis, Panagiotis ; Göbel, Andreas ; Roth, Marc ; Schmitt, Johannes 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Counting (Dagstuhl Seminar 13031)
  Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark ; Koiran, Pascal
• Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
  Dyer, Martin ; Feige, Uriel ; Frieze, Alan M. ; Karpinski, Marek
• Log-supermodular functions, functional clones and counting CSPs
  Bulatov, Andrei A. ; Dyer, Martin ; Goldberg, Leslie Ann ; Jerrum, Mark 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik