Loading

Error: Cannot Load Popup Box

Hit List

Title:

Reliabilität motorischer fMRT Paradigmen

Publisher:

Ludwig-Maximilians-Universität München

Year of Publication:

2011-02-03

Document Type:

Dissertation ; NonPeerReviewed

Subjects:

Medizinische Fakultät

Medizinische Fakultät Minimize

Relations:

http://edoc.ub.uni-muenchen.de/12670/

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions

Description:

Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color Tantrix(TM) rotation puzzle problems (3-TRP and 2-TRP) and thei...

Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color Tantrix(TM) rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed colors to three (respectively, to two) reduces the set of available Tantrix(TM) tiles from 56 to 14 (respectively, to 8). We prove that 3-TRP and 2-TRP are NP-complete, which answers a question raised by Holzer and Holzer in the affirmative. Since our reductions are parsimonious, it follows that the problems Unique-3-TRP and Unique-2-TRP are DP-complete under randomized reductions. We also show that the another-solution problems associated with 4-TRP, 3-TRP, and 2-TRP are NP-complete. Finally, we prove that the infinite variants of 3-TRP and 2-TRP are undecidable. ; Comment: 30 pages, 25 figures Minimize

Year of Publication:

2007-11-12

Document Type:

text

Subjects:

Computer Science - Computational Complexity ; F.1.3 ; F.2.2

Computer Science - Computational Complexity ; F.1.3 ; F.2.2 Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem

Description:

Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimonio...

Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix(TM) rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the unique Tantrix(TM) rotation puzzle problem is as hard as the unique satisfiability problem, and so is DP-complete under polynomial-time randomized reductions, where DP is the second level of the boolean hierarchy over NP. ; Comment: 19 pages, 16 figures, appears in the Proceedings of "Machines, Computations and Universality" (MCU 2007) Minimize

Year of Publication:

2007-05-07

Document Type:

text

Subjects:

Computer Science - Computational Complexity ; F.1.3 ; F.2.2

Computer Science - Computational Complexity ; F.1.3 ; F.2.2 Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules

Description:

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1] proved a result that is only one step away from a full dichotomy of this problem for the important class o...

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1] proved a result that is only one step away from a full dichotomy of this problem for the important class of pure scoring rules in the case of unweighted voters and an unbounded number of candidates: Possible Winner is NP-complete for all pure scoring rules except plurality, veto, and the scoring rule with vector (2,1,.,1,0), but is solvable in polynomial time for plurality and veto. We take the final step to a full dichotomy by showing that Possible Winner is NP-complete also for the scoring rule with vector (2,1,.,1,0). ; Comment: 9 pages, to appear in Information Processing Letters Minimize

Year of Publication:

2011-08-22

Document Type:

text

Subjects:

Computer Science - Computational Complexity

Computer Science - Computational Complexity Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Hilfreiche Hilfe? : adaptives Learning-on-Demand

Publisher:

Ges. für Informatik

Year of Publication:

2008

Document Type:

Aufsatz in einem Buch

Relations:

Desel, Jörg ; Iglezakis, Dorothea: Hilfreiche Hilfe? : adaptives Learning-on-Demand. In: Seehusen, Silke ; Lucke, Ulrike ; Fischer, Stefan (Hrsg.): DeLFI 2008 : die 6. E-Learning Fachtagung Informatik der Gesellschaft für Informatik e.V. ; 07. - 10. September 2008 in Lübeck, Germany. - Bonn : Ges. für Informatik, 2008. - S. 293-304. -...

My Lists:

My Tags:

Notes:

Title:

Exploratory Network Visualization : Simultaneous Display of Actor Status and Connections

Author:

Description:

We propose a novel visualization approach that facilitates graphical exploration and communication of relative actor status in social networks. The main idea is to map, in a drawing of the entire network, actor status scores to vertical coordinates. The resulting problem of determining horizontal positions of actors and routing of connecting lin...

We propose a novel visualization approach that facilitates graphical exploration and communication of relative actor status in social networks. The main idea is to map, in a drawing of the entire network, actor status scores to vertical coordinates. The resulting problem of determining horizontal positions of actors and routing of connecting lines such that the overall layout is readable is algorithmically diffcult, yet well-studied in the literature on graph drawing. We outline a customized approach. The advantages of our method are illustrated in a study of policy making structures from the privatization processes of former East German industrial conglomerates, in which the visual approach led to additional findings that are unlikely to have been revealed using non-visual means of analysis. Minimize

Year of Publication:

2001

Source:

First publ. in: Journal of Social Structure 2 (2001), No. 4

First publ. in: Journal of Social Structure 2 (2001), No. 4 Minimize

Document Type:

doc-type:article ; doc-type:Text

Language:

eng

Subjects:

ddc:004

ddc:004 Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

The Three-Color and Two-Color Tantrix TM Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions ∗

Description:

Holzer and Holzer [HH04] proved that the Tantrix TM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color Tantrix TM rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed co...

Holzer and Holzer [HH04] proved that the Tantrix TM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color Tantrix TM rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed colors to three (respectively, to two) reduces the set of available Tantrix TM tiles from 56 to 14 (respectively, to 8). We prove that 3-TRP and 2-TRP are NPcomplete, which answers a question raised by Holzer and Holzer [HH04] in the affirmative. Since our reductions are parsimonious, it follows that the problems Unique-3-TRP and Unique-2-TRP are DP-complete under randomized reductions. We also show that the another-solution problems associated with 4-TRP, 3-TRP, and 2-TRP are NPcomplete. Finally, we prove that the infinite variants of 3-TRP and 2-TRP are undecidable. 1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2013-08-06

Source:

http://arxiv.org/pdf/0711.1827v3.pdf

http://arxiv.org/pdf/0711.1827v3.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

BacDive—the Bacterial Diversity Metadatabase

Author:

Description:

BacDive—the Bacterial Diversity Metadatabase (http://bacdive.dsmz.de) merges detailed strain-linked information on the different aspects of bacterial and archaeal biodiversity. Currently (release 9/2013), BacDive contains entries for 23 458 strains and provides information on their taxonomy, morphology, physiology, sampling and concomitant envir...

BacDive—the Bacterial Diversity Metadatabase (http://bacdive.dsmz.de) merges detailed strain-linked information on the different aspects of bacterial and archaeal biodiversity. Currently (release 9/2013), BacDive contains entries for 23 458 strains and provides information on their taxonomy, morphology, physiology, sampling and concomitant environmental conditions as well as molecular biology. Where available, links to access the respective biological resources are given. The majority of the BacDive data is manually annotated and curated. The BacDive portal offers an easy-to-use simple search and in addition powerful advanced search functionalities allowing to combine more than 30 search fields for text and numerical data. The user can compile individual sets of strains to a download selection that can easily be imported into nearly all spreadsheet applications. Minimize

Publisher:

Oxford University Press

Year of Publication:

2014-01

Document Type:

Text

Language:

en

Subjects:

IV. Viruses ; bacteria ; protozoa and fungi

IV. Viruses ; bacteria ; protozoa and fungi Minimize

Rights:

© The Author(s) 2013. Published by Oxford University Press. ; http://creativecommons.org/licenses/by/3.0/ ; This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided ...

© The Author(s) 2013. Published by Oxford University Press. ; http://creativecommons.org/licenses/by/3.0/ ; This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Satisfiability parsimoniously reduces to the Tantrix rotation puzzle problem

Description:

Holzer and Holzer [HH04] proved that the Tantrix rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix rotation puzzle proble...

Holzer and Holzer [HH04] proved that the Tantrix rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the unique Tantrix TM rotation puzzle problem is as hard as the unique satisfiability problem, and so is DP-complete under polynomial-time randomized reductions, where DP is the second level of the boolean hierarchy over NP. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2011-05-05

Source:

http://ccc.cs.uni-duesseldorf.de/~rothe/PDF/tantrix-four-color-MCU2007.pdf

http://ccc.cs.uni-duesseldorf.de/~rothe/PDF/tantrix-four-color-MCU2007.pdf Minimize

Document Type:

text

Language:

en

Subjects:

computational complexity ; rotation puzzle ; tiling of the plane ; parsimonious reduction

computational complexity ; rotation puzzle ; tiling of the plane ; parsimonious reduction Minimize

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

The Three-Color and Two-Color Tantrix TM Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions ∗

Description:

Holzer and Holzer [HH04] proved the Tantrix TM rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color ...

Holzer and Holzer [HH04] proved the Tantrix TM rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix TM rotation puzzle problem is DP-complete under randomized reductions. In this paper, we study the three-color and the two-color Tantrix TM rotation puzzle problem. Restricting the number of allowed colors to three (respectively, to two) reduces the set of available Tantrix TM tiles from 56 to 14 (respectively, to 8). We prove that both the three-color and the two-color Tantrix TM rotation puzzle problem is NP-complete, which answers a question raised by Holzer and Holzer [HH04] in the affirmative. Since both these reductions are parsimonious, it follows that both the unique three-color and the unique two-color Tantrix TM rotation puzzle problem is DP-complete under randomized reductions. Finally, we prove that the infinite version of both the threecolor and the two-color Tantrix TM rotation puzzle problem is undecidable. 1 Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2013-08-05

Source:

http://arxiv.org/pdf/0711.1827v1.pdf

http://arxiv.org/pdf/0711.1827v1.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 68,042,637 Documents of 3,301 Content Sources

http://www.base-search.net