Wird aktualisiert...
Unten findet man Ihre Wettbewerber – zeigen auch Sie sich zu np-hard!
Hier klicken für Ihr Exposé |
Wolfgang Mulzer
Minimum Weight Triangulation is NP-Hard: Wolfgang Mulzer, G¨unter Rote: MWT is NP-hard—December 22,2005 2 this list have been resolved by proving NP-hardness …
Sebastian Iwanowski
Testing Approximate Symmetry in the Plane is NP-Hard: Authors: Sebastian Iwanowski. Citations: 6 … The following links allow you to view full publications. …
Mark Scharbrodt
Thomas Odenthal y. Mark Scharbrodt. y. Abstract. The thickness problem on graphs is NP-hard and only few results concerning. this graph invariant are known.
Toni Pitassi
Pool resolution is NP-hard to recognize. Sam Buss. Department … A pool resolution proof is a dag-like resolution … Hertel, Jan Hoffmann, Toni Pitassi, …
Alexander Nadel
Digital circuits with feedback loops can solve some instances of NP-hard problems ... [10] Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel. ...
Reinhard Hainz
Minimum Weight Triangulation is NP-Hard - page.mi.fu-berlin.de …: tic by Reinhard Hainz from TU Graz, prepared under the supervision of Oswin Aichholzer. …
Stephen Travers
False Positives and NP-Hard Sets Christian Glaßer∗,A.Pavan †, and Stephen Travers ‡ Abstract We study the effects of faulty data on NP-hard sets.
Christian Glaßer
False Positives and NP-Hard Sets Christian Glaßer∗,A.Pavan †, and Stephen Travers ‡ Abstract We study the effects of faulty data on NP-hard sets.
Nadja Betzler
Search results for "NP-hardness" – FacetedDBLP: Nadja Betzler, Britta Dorn: Towards a Dichotomy …
Christiane Zeck
Integer Flows with Mul…liers 1 and 2 with Sven O. Krumke, Rainer Schrader, Christiane Zeck, … Game is NP-hard! with Tom …
Marita Venth
Research interests. Parameterized Com…tional Complexity, NP-hard problems, Exact Algorithms, Graph Algorithms. Book. Book cover. Rolf Niedermeier: ...
Frank Gurski
@INPROCEEDINGS(Espelage01howto, author = (Wolfgang Espelage and Frank Gurski and Egon …e), title = (How to solve NP-hard graph problems on clique-width bounded
Bjarne Andresen
1999; 1: EE: Yaghout Nourani, Bjarne Andresen: Exploration of NP-hard Enumeration Problems by Simulated Annealing - the Spectrum Values of Permanents.
Yaghout Nourani
… Theoretical Computer Science 215 (1999) 51-68 Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents Yaghout …
Dietmar Herwig
Dietmar Herwig Coauthor index pubzone.org ... Hans-Dietrich Hecker, Dietmar Herwig: Some NP-hard Polygon Cover Problems. Elektronische ...
Nach Beruf: ABCDEFGHIJKLMNOPQRSTUVWXYZ Nach Firma: ABCDEFGHIJKLMNOPQRSTUVWXYZ