1
0
0
(1 - 12 von 14
)
Settling the complexity of local max-cut (almost) completelyarXiv
arxiv.org
von R Elsaesser · · Zitiert von: 33 — From: Tobias Tscheuschner [view email] [v1] Thu, 29 Apr :53:00 UTC (366 KB) [v2] Fri, 5 Nov :51:06 UTC (326 KB)
Opponent-Pruning Paranoid SearchCentrum Wiskunde & Informatica
ir.cwi.nl
von H Baier · · Zitiert von: 5 — [9] Ulf Lorenz and Tobias Tscheuschner Player Modeling, Search Algorithms and Strategies in Multi-player Games. In 11th International Conference on ...
Sampling Frequency Thresholds for Quantum Advantage ...Research Square
www.researchsquare.com
von D Lykov · · Zitiert von: 3 — 48 Robert Elsässer and Tobias Tscheuschner, “Settling the complexity of local Max-Cut (almost) completely,” in.
Selfish Routing in NetworksThe University of Liverpool
intranet.csc.liv.ac.uk
von M Gairing · Zitiert von: 4 — Tobias Tscheuschner, Andreas Woclaw, and Oleksiy Znamenshchykov. Before coming to Paderborn, I benefited from a number of mentors at Clem- son University.
On the PLS-complexity of maximum constraint assignmentScienceDirect
www.sciencedirect.com
von D Dumrauf · · Zitiert von: 6 — [12] Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner, Local search: simple, successful, but sometimes sluggish, in: Samson Abramsky,.
.uni-magdeburg.deUni Halle
opendata.uni-halle.de
von M Mörig · Zitiert von: 6 — Marc Mörig, Sven Scholz, Tobias Tscheuschner, and Eric Berberich, Chapter 6. Implementation Aspects, in Müller-Hannemann and Schirra [73], pp. 237–289.
Monomolecular and Bimolecular Recombination of Electron ...
eref.uni-bayreuth.de
von T Hahn · · Zitiert von: 52 — Hahn, Tobias ; Tscheuschner, Steffen ; Kahle, Frank-Julian ; Reichenberger, Markus ; Athanasopoulos, Stavros ; Saller, Christina ; Bazan, ... › ...
On the Power of Nodes of Degree Four in the Local Max- ...Springer
link.springer.com
von B Monien · · Zitiert von: 17 — On the Power of Nodes of Degree Four in the Local Max-Cut Problem. Burkhard Monien &; Tobias Tscheuschner. Conference paper Accesses. 9 Citations.
Player Modeling, Search Algorithms and Strategies in Multi ...Springer
link.springer.com
von U Lorenz · · Zitiert von: 19 — Player Modeling, Search Algorithms and Strategies in Multi-player Games. Ulf Lorenz &; Tobias Tscheuschner. Conference paper Accesses. 5 Citations.
Settling the Complexity of Local Max-Cut (Almost) Completely
link.springer.com
von R Elsässer · · Zitiert von: 26 — Settling the Complexity of Local Max-Cut (Almost) Completely. Robert Elsässer &; Tobias Tscheuschner. Conference paper Accesses. 5 Citations. von M Kirschner · · Zitiert von: 3 — Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. Matthias Kirschner,; Philipp Schengbier &; Tobias Tscheuschner. › chapter
PublicationsDC Lead
algorithms.cosy.sbg.ac.at
von G Bankhamer · · Zitiert von: 7 — of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), 2011, Robert Elsässer, Tobias Tscheuschner. Settling the ...
Smoothed Complexity of Local Max-Cut and Binary Max-CSPNational Science Foundation (.gov)
par.nsf.gov
von X Chen · · Zitiert von: 14 — [5] Robert Elsässer and Tobias Tscheuschner Settling the complexity of local max-cut (almost) completely. In International Colloquium on Automata, ...
Alle Infos zum Namen "Tobias Tscheuschner"
sortiert nach Relevanz / Datum