text:
Attitude change

Attitudes are associated beliefs and behaviors towards some object. They are not stable, and because of the communication and behavior of other people, are subject to change by social influences, as well as by the individual's motivation to maintain cognitive consistency when cognitive dissonance occurs—when two attitudes or attitude and behavior conflict. Attitudes and attitude objects are functions of affective and cognitive components. It has been suggested that the inter-structural composition of an associative network can be altered by the activation of a single node. Thus, by activating an affective or emotional node, attitude change may be possible, though affective and cognitive components tend to be intertwined.

Bases
There are three bases for attitude change: compliance, identification, and internalization. These three processes represent the different levels of attitude change.

Compliance

Compliance refers to a change in behavior based on consequences, such as an individual's hopes to gain rewards or avoid punishment from another group or person. The individual does not necessarily experience changes in beliefs or evaluations of an attitude object, but rather is influenced by the social outcomes of adopting a change in behavior. The individual is also often aware that he or she is being urged to respond in a certain way.

Compliance was demonstrated through a series of laboratory experiments known as the Asch experiments. Experiments led by Solomon Asch of Swarthmore College asked groups of students to participate in a "vision test". In reality, all but one of the participants were confederates of the experimenter, and the study was really about how the remaining student would react to the confederates' behavior. Participants were asked to pick, out of three line options, the line that is the same length as a sample and were asked to give the answer out loud. Unbeknown to the participants, Asch had placed a number of confederates to deliberately give the wrong answer before the participant. The results showed that 75% of responses were in line with majority influence and were the same answers the confederates picked. Variations in the experiments showed that compliance rates increased as the number of confederates increased, and the plateau was reached with around 15 confederates. The likelihood of compliance dropped with minority opposition, even if only one confederate gave the correct answer. The basis for compliance is founded on the fundamental idea that people want to be accurate and right.

Identification
Identification explains one's change of beliefs and affect in order to be similar to someone one admires or likes. In this case, the individual adopts the new attitude, not due to the specific content of the attitude object, but because it is associated with the desired relationship. Often, children's attitudes on race, or their political party affiliations are adopted from their parents' attitudes and beliefs.

Internalization
Internalization refers to the change in beliefs and affect when one finds the content of the attitude to be intrinsically rewarding, and thus leads to actual change in beliefs or evaluations of an attitude object. The new attitude or behavior is consistent with the individual's value system, and tends to be merged with the individual's existing values and beliefs. Therefore, behaviors adopted through internalization are due to the content of the attitude object.

The expectancy-value theory is based on internalization of attitude change. This model states that the behavior towards some object is a function of an individual's intent, which is a function of one's overall attitude towards the action.

Emotion-based
Emotion plays a major role in persuasion, social influence, and attitude change. Much of attitude research has emphasised the importance of affective or emotion components. Emotion works hand-in-hand with the cognitive process, or the way we think, about an issue or situation. Emotional appeals are commonly found in advertising, health campaigns and political messages. Recent examples include no-smoking health campaigns (see tobacco advertising) and political campaigns emphasizing the fear of terrorism. Attitude change based on emotions can be seen vividly in serial killers who are faced with major stress. There is considerable empirical support for the idea that emotions in the form of fear arousal, empathy, or a positive mood can enhance attitude change under certain conditions.

Important factors that influence the impact of emotional appeals include self-efficacy, attitude accessibility, issue involvement, and message/source features. Attitudes that are central to one's being are highly resistant to change while others that are less fixed may change with new experiences or information. A new attitude (e.g. to time-keeping or absenteeism or quality) may challenge existing beliefs or norms so creating a feeling of psychological discomfort known as cognitive dissonance. It is difficult to measure attitude change since attitudes may only be inferred and there might be significant divergence between those publicly declared and privately held. Self-efficacy is a perception of one's own human agency; in other words, it is the perception of our own ability to deal with a situation. It is an important variable in emotional appeal messages because it dictates a person's ability to deal with both the emotion and the situation. For example, if a person is not self-efficacious about their ability to impact the global environment, they are not likely to change their attitude or behaviour about global warming.

Affective forecasting, otherwise known as intuition or the prediction of emotion, also impacts attitude change. Research suggests that predicting emotions is an important component of decision making, in addition to the cognitive processes. How we feel about an outcome may override purely cognitive rationales. In terms of research methodology, the challenge for researchers is measuring emotion and subsequent impacts on attitude. Since we cannot see into the brain, various models and measurement tools have been constructed to obtain emotion and attitude information. Measures may include the use of physiological cues like facial expressions, vocal changes, and other body rate measures. For instance, fear is associated with raised eyebrows, increased heart rate and increased body tension. Other methods include concept or network mapping, and using primes or word cues.

Dual models: depth of processing
Many dual process models are used to explain the affective (emotional) and cognitive processing and interpretations of messages, as well as the different depths of attitude change. These include the heuristic-systematic model of information processing and the elaboration likelihood model.

Heuristic-systematic model of information processing
The heuristic-systematic model of information processing describes two depths in the processing of attitude change, systematic processing and heuristic processing. In this model information is either processed in a high-involvement and high-effort systematic way, or information is processed through shortcuts known as heuristics. For example, emotions are affect-based heuristics, in which feelings and gut-feeling reactions are often used as shortcuts.

Systematic processing
Systematic processing occurs when individuals are motivated and have high cognition to process a message. Individuals using systematic processing are motivated to pay attention and have the cognitive ability to think deeply about a message; they are persuaded by the content of the message, such as the strength or logic of the argument. Motivation can be determined by many factors, such as how personally relevant the topic is, and cognitive ability can be determined by how knowledgeable an individual is on the message topic, or whether or not there is a distraction in the room. Individuals who receive a message through systematic processing usually internalize the message, resulting in a longer and more stable attitude change.

According to the heuristic-systematic model of information processing, people are motivated to use systematic processing when they want to achieve a "desired level of confidence" in their judgments. There are factors that have been found to increase the use of systematic processing; these factors are associated with either decreasing an individual's actual confidence or increasing an individual's perceived confidence. These factors may include framing persuasive messages in an unexpected manner; self-relevancy of the message.

Systematic processing has been shown to be beneficial in social influence settings. Systematic reasoning has been shown to be successful in producing more valid solutions during group discussions and greater solution accuracy. Shestowsky's (1998) research in dyad discussions revealed that the individual in the dyad who had high motivation and high need in cognition had the greater impact on group decisions.

Heuristic processing
Heuristic processing occurs when individuals have low motivation and/or low cognitive ability to process a message. Instead of focusing on the argument of the message, recipients using heuristic processing focus on more readily accessible information and other unrelated cues, such as the authority or attractiveness of the speaker. Individuals who process a message through heuristic processing do not internalize the message, and thus any attitude change resulting from the persuasive message is temporary and unstable.

For example, people are more likely to grant favors if reasons are provided. A study shows that when people said, "Excuse me, I have five pages to xerox. May I use the copier?" they received a positive response of 60%. The statement, "Excuse me, I have five pages to xerox. I am in a rush. May I use the copier?" produced a 95% success rate.

Heuristic processing examples include social proof, reciprocity, authority, and liking.

 * Social proof is the means by which we utilize other people's behaviors in order to form our own beliefs. Our attitudes toward following the majority change when a situation appears uncertain or ambiguous to us, when the source is an expert, or when the source is similar to us. In a study conducted by Sherif, he discovered the power of crowds when he worked with experimenters who looked up in the middle of New York City. As the number of the precipitating group increased, the percentage of passers-by who looked up increased as well.
 * Reciprocity is returning a favor. People are more likely to return a favor if they have a positive attitude towards the other party. Reciprocities also develop interdependence and societal bonds.
 * Authority plays a role in attitude change in situations where there are superior-inferior relationships. We are more likely to become obedient to authorities when the authority's expertise is perceived as high and when we anticipate receiving rewards. A famous study that constitutes the difference in attitude change is the Milgram experiment,  where people changed their attitude to "shocking their partner" more when they followed authorities whereas the subjects themselves would have not done so otherwise.
 * Liking has shown that if one likes another party, one is more inclined to carry out a favor. The attitude changes are based on whether an individual likes an idea or person, and if he or she does not like the other party, he/she may not carry out the favor or do so out of obligation. Liking can influence one's opinions through factors such as physical attractiveness, similarities, compliments, contact and cooperation.

Elaboration likelihood model
The elaboration likelihood model is similar in concept to and shares many ideas with other dual processing models, such as the heuristic-systematic model of information processing. In the elaboration likelihood model, cognitive processing is the central route and affective/emotion processing is often associated with the peripheral route. The central route pertains to an elaborate cognitive processing of information while the peripheral route relies on cues or feelings. The ELM suggests that true attitude change only happens through the central processing route that incorporates both cognitive and affective components as opposed to the more heuristics-based peripheral route. This suggests that motivation through emotion alone will not result in an attitude change.

Cognitive dissonance theory
Cognitive dissonance, a theory originally developed by Festinger (1957), is the idea that people experience a sense of guilt or uneasiness when two linked cognitions are inconsistent, such as when there are two conflicting attitudes about a topic, or inconsistencies between one's attitude and behavior on a certain topic. The basic idea of the Cognitive Dissonance Theory relating to attitude change, is that people are motivated to reduce dissonance which can be achieved through changing their attitudes and beliefs. Cooper & Fazio's (1984) have also added that cognitive dissonance does not arise from any simple cognitive inconsistency, but rather results from freely chosen behavior that may bring about negative consequences. These negative consequences may be threats to the consistency, stability, predictability, competence, moral goodness of the self-concept, or violation of general self-integrity.

Research has suggested multiple routes that cognitive dissonance can be reduced. Self-affirmation has been shown to reduce dissonance, however it is not always the mode of choice when trying to reduce dissonance. When multiple routes are available, it has been found that people prefer to reduce dissonance by directly altering their attitudes and behaviors rather than through self-affirmation. People who have high levels of self-esteem, who are postulated to possess abilities to reduce dissonance by focusing on positive aspects of the self, have also been found to prefer modifying cognitions, such as attitudes and beliefs, over self-affirmation. A simple example of cognitive dissonance resulting in attitude change would be when a heavy smoker learns that his sister died young from lung cancer due to heavy smoking as well, this individual experiences conflicting cognitions: the desire to smoke, and the knowledge that smoking could lead to death and a desire not to die. In order to reduce dissonance, this smoker could change his behavior (i.e. stop smoking), change his attitude about smoking (i.e. smoking is harmful), or retain his original attitude about smoking and modify his new cognition to be consistent with the first one--"I also work out so smoking won't be harmful to me". Thus, attitude change is achieved when individuals experience feelings of uneasiness or guilt due to cognitive dissonance, and actively reduce the dissonance through changing their attitude, beliefs, or behavior relating in order to achieve consistency with the inconsistent cognitions.

Sorts of studies
Carl Hovland and his band of persuasion researchers learned a great deal during World War 2 and later at Yale about the process of attitude change.
 * High-credibility sources lead to more attitude change immediately following the communication act, but a sleeper effect occurs in which the source is forgotten after a period of time.
 * Mild fear appeals lead to more attitude change than strong fear appeals. Propagandists had often used fear appeals. Hoveland's evidence about the effect of such appeals suggested that a source should be cautious in using fear appeals, because strong fear messages may interfere with the intended persuasion attempt.

Belief rationalization
The process of how people change their own attitudes has been studied for years. Belief rationalization has been recognized as an important aspect to understand this process. The stability of people's past attitudes can be influenced if they hold beliefs that are inconsistent with their own behaviors. The influence of past behavior on current attitudes is stable when little information conflicts with the behavior. Alternatively, people's attitudes may lean more radically toward the prior behavior if the conflict makes it difficult to ignore, and forces them to rationalize their past behavior.

Attitudes are often restructured at the time people are asked to report them. As a result, inconsistencies between the information that enters into the reconstruction and the original attitudes can produce changes in prior attitudes, whereas consistency between these elements often elicits stability in prior attitudes. Individuals need to resolve the conflict between their own behaviors and the subsequent beliefs. However, people usually align themselves with their attitudes and beliefs instead of their behaviors. More importantly, this process of resolving people's cognitive conflicts that emerges cuts across both self-perception and dissonance even when the associated effect may only be strong in changing prior attitudes

Comparative processing
Human judgment is comparative in nature. Departing from identifying people's need to justify their own beliefs in the context of their own behaviors, psychologists also believe that people have the need to carefully evaluate new messages on the basis of whether these messages support or contradict with prior messages, regardless of whether they can recall the prior messages after they reach a conclusion. This comparative processing mechanism is built on "information-integration theory" and "social judgement theory". Both of these theories have served to model people's attitude change in judging the new information while they have not adequately explained the influential factors that motivate people to integrate the information.

More recent work in the area of persuasion has further explored this "comparative processing" from the perspective of focusing on comparing between different sets of information on one single issue or object instead of simply making comparisons among different issues or objects. As previous research demonstrated, analyzing information on one target product may trigger less impact of comparative information than comparing this product with the same product under competing brands.

When people compare different sets of information on one single issue or object, the effect of people's effort to compare new information with prior information seemed to correlate with the perceived strength of the new, strong information when considered jointly with the initial information. Comparison processes can be enhanced when prior evaluations, associated information, or both are accessible. People will simply construct a current judgment based on the new information or adjust the prior judgment when they are not able to retrieve the information from prior messages. The impact this comparative process can have on people's attitude change is mediated by changes in the strength of new information perceived by receivers. The effects of comparison on judgment change were mediated by changes in the perceived strength of the information. These findings above have wide range of applications in social marketing, political communication, and health promotion. For example, designing an advertisement that is counteractive against an existing attitude towards a behavior or policy is perhaps most effective if the advertisement uses the same format, characters, or music of ads associated with the initial attitudes.

title: Attitude change


text:
Yukikaze (novel)

Yukikaze (戦闘妖精雪風) is a Japanese military science fiction novel series written by Chōhei Kambayashi. First published as a series of short stories, a collected bunkobon volume was released by Hayakawa Publishing in 1984. It was followed by two sequels, released in 1999 and 2009. A five-episode original video animation (OVA) series, produced by Gonzo and Bandai Visual, was released in Japan from August 2002 to August 2005.

The series is notable for its air combat scenes, which were created with the help of the Japan Air Self-Defense Force. The JASDF worked with the Gonzo production team by recording actual sounds of the F-15J Eagle and running test flights at Komatsu Air Base, and having discussions on air combat tactics.

In 1985, Yukikaze received the 16th Seiun Award for Best Japanese Long Work. The OVA series has twice won the Tokyo Anime Award for Original Video Animation in 2003 and 2006.

Premise
Yukikaze occurs in the early 21st century. Thirty-three years before the events of the series, an alien force known as the JAM invade Earth through a dimensional portal that appeared over Antarctica. Without alarming the general public, the United Nations establishes a defense force to oppose the threat and after a series of bloody battles, manages to push the enemy back to the other side of the portal. The UN establishes five bases on the JAM homeworld, a planet named "Fairy", to continue the offensive against the JAM with the Fairy Air Force (FAF) leading the way. The main character, Lt Rei Fukai, pilots the FFR-31MR/D Super Sylph (later the FFR-41MR Mave) fighter B-503, nicknamed "Yukikaze", an advanced armed tactical reconnaissance plane equipped with a near-sentient AI system, and belongs to the FAF's combat intelligence wing the Special Air Force (SAF)'s recon squadron, known as Boomerang Squadron. Over the course of the series, Fukai and the FAF struggles to defeat the JAM, who have perfected the art of human cloning and planted agents all over the FAF.

Characters

 * Rei is a 2nd Lieutenant in the FAF's Special Air Force (SAF) reconnaissance unit. He is the pilot of the B-503 "Yukikaze" fighter. Although depicted as a loner and having a tendency toward social rejection, he is good friends with Jack Bukhar and eventually interacts with other SAF pilots.
 * Rei is a 2nd Lieutenant in the FAF's Special Air Force (SAF) reconnaissance unit. He is the pilot of the B-503 "Yukikaze" fighter. Although depicted as a loner and having a tendency toward social rejection, he is good friends with Jack Bukhar and eventually interacts with other SAF pilots.
 * Rei is a 2nd Lieutenant in the FAF's Special Air Force (SAF) reconnaissance unit. He is the pilot of the B-503 "Yukikaze" fighter. Although depicted as a loner and having a tendency toward social rejection, he is good friends with Jack Bukhar and eventually interacts with other SAF pilots.

 * The de facto second-in-command of the SAF, Bukhar is Rei's commanding officer. Despite the seniority, he is the only person in the FAF to even befriend Fukai and help him deal with the stress of battle. A prominent theme with the character is his interest in boomerangs and their aerodynamic characteristics.
 * The de facto second-in-command of the SAF, Bukhar is Rei's commanding officer. Despite the seniority, he is the only person in the FAF to even befriend Fukai and help him deal with the stress of battle. A prominent theme with the character is his interest in boomerangs and their aerodynamic characteristics.
 * The de facto second-in-command of the SAF, Bukhar is Rei's commanding officer. Despite the seniority, he is the only person in the FAF to even befriend Fukai and help him deal with the stress of battle. A prominent theme with the character is his interest in boomerangs and their aerodynamic characteristics.

 * A former investment banker who signed up with the FAF during the early days of the JAM war, Cooley is a skilled player in the FAF's power struggles. She is the SAF's commander with the rank of brigadier-general.
 * A former investment banker who signed up with the FAF during the early days of the JAM war, Cooley is a skilled player in the FAF's power struggles. She is the SAF's commander with the rank of brigadier-general.
 * A former investment banker who signed up with the FAF during the early days of the JAM war, Cooley is a skilled player in the FAF's power struggles. She is the SAF's commander with the rank of brigadier-general.

 * A psychiatrist by trade, Foss is attached to the FAF and holds the rank of captain. In the series, Foss is responsible for profiling Yukikaze and diagnosing Rei Fukai after he lapsed into a quasi-comatose state when his first aircraft is destroyed. Cooley later orders her to "profile" the JAM as a single entity. Also, she's the niece of brigadier-general Rydia Cooley.
 * A psychiatrist by trade, Foss is attached to the FAF and holds the rank of captain. In the series, Foss is responsible for profiling Yukikaze and diagnosing Rei Fukai after he lapsed into a quasi-comatose state when his first aircraft is destroyed. Cooley later orders her to "profile" the JAM as a single entity. Also, she's the niece of brigadier-general Rydia Cooley.
 * A psychiatrist by trade, Foss is attached to the FAF and holds the rank of captain. In the series, Foss is responsible for profiling Yukikaze and diagnosing Rei Fukai after he lapsed into a quasi-comatose state when his first aircraft is destroyed. Cooley later orders her to "profile" the JAM as a single entity. Also, she's the niece of brigadier-general Rydia Cooley.

 * A second lieutenant of the FAF, Burgadish is assigned as the Yukikaze's flight officer following the death of Lieutenant Norman Hughes.
 * A second lieutenant of the FAF, Burgadish is assigned as the Yukikaze's flight officer following the death of Lieutenant Norman Hughes.
 * A second lieutenant of the FAF, Burgadish is assigned as the Yukikaze's flight officer following the death of Lieutenant Norman Hughes.

 * One of the few civilian characters in the series, Jackson is the author of The Invader, a chronicle of the FAF's struggle against the JAM. She went to Antarctica to research the book several times.
 * One of the few civilian characters in the series, Jackson is the author of The Invader, a chronicle of the FAF's struggle against the JAM. She went to Antarctica to research the book several times.
 * One of the few civilian characters in the series, Jackson is the author of The Invader, a chronicle of the FAF's struggle against the JAM. She went to Antarctica to research the book several times.

 * An American free columnist who travels to the FAF base on Fairy.
 * An American free columnist who travels to the FAF base on Fairy.

 * A Native American FAF captain. Was part of the development team that built Yukikaze's AI. Has a plutonium battery-powered artificial heart.
 * A Native American FAF captain. Was part of the development team that built Yukikaze's AI. Has a plutonium battery-powered artificial heart.
 * A Native American FAF captain. Was part of the development team that built Yukikaze's AI. Has a plutonium battery-powered artificial heart.

 * An FAF captain assigned to the experimental fighter Fern II.
 * An FAF captain assigned to the experimental fighter Fern II.

 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.
 * Rombert is a colonel who leads the FAF Intelligence Division. He is determined to find out more about the JAM.

 * An FAF major stationed at the TAB-14 frontline base. Yazawa is actually a Jam taking a human form who attempts to extract the security code of Yukikaze from a captured Rei and Burgadish.
 * An FAF major stationed at the TAB-14 frontline base. Yazawa is actually a Jam taking a human form who attempts to extract the security code of Yukikaze from a captured Rei and Burgadish.
 * An FAF major stationed at the TAB-14 frontline base. Yazawa is actually a Jam taking a human form who attempts to extract the security code of Yukikaze from a captured Rei and Burgadish.

 * A nurse from the TAB-14 base. Like Yazawa, Marnie is a JAM taking a human form.
 * A nurse from the TAB-14 base. Like Yazawa, Marnie is a JAM taking a human form.
 * A nurse from the TAB-14 base. Like Yazawa, Marnie is a JAM taking a human form.

Novel
Yukikaze, written by Chōhei Kanbayashi, was published a series of short stories in S-F Magazine from 1979 to 1983, and was later collected by Hayakawa Publishing in a bunkobon volume on February 1, 1984. It was followed by three sequels: Good Luck, Yukikaze (グッドラック 戦闘妖精・雪風), released on May 1, 1999; Unbroken Arrow, Yukikaze (アンブロークン アロー 戦闘妖精・雪風), released on July 25, 2009; and Aggressors, Yukikaze (アグレッサーズ 戦闘妖精・雪風), released on April 20, 2022.

Viz Media licensed the first two novels for English release in North America. Yukikaze was released on January 19, 2010. Good Luck, Yukikaze was released on July 19, 2011.

Original video animation
Produced by Gonzo, Victor Entertainment and Bandai Visual to commemorate Bandai Visual's 20th anniversary. The five episode series was originally released directly to DVD as an original video animation. It was later aired in Japan on the anime television network Animax, which also aired the series on its English language networks across Southeast Asia and other networks worldwide. The series' ending theme is "RTB" by Monsieur Kamayatsu.

Yukikaze was licensed for an English language release in North America by Bandai Entertainment, and in Australia and New Zealand by Madman Entertainment. In 2018, the series and its spinoff Fighting Fantasy Girl Rescue Me: Mave-chan were streamed online by Tubi.

Reception
Yukikaze won the 16th Seiun Award for Best Japanese Long Work. The OVA series won the Tokyo Anime Award for Original Video Animation in both 2003 and 2006.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Yukikaze (novel)


text:
Wikipedia:Articles for deletion/Lunia

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was - merged - SimonP 02:23, Jun 15, 2005 (UTC)

Lunia and Mercuria
RPG trivia spawned from Mt. Celestia. I have doubts about that article too, but I won't nominate it. Gazpacho 07:23, 30 May 2005 (UTC)
 * Delete. Yikes. I should make a Outer Planes (Dungeons and Dragons) article sometime, though. A Man In Black 08:17, 30 May 2005 (UTC)
 * Merge with Mt. Celestia. I think Lunia is an "official" D&D place or plane. Sjakkalle 09:13, 30 May 2005 (UTC)
 * Oh and Gazpacho, remember to make a redirect from the VfD tag on Lunia to this page. You forgot to do so. Sjakkalle 09:15, 30 May 2005 (UTC)
 * For the record, they're both layers of an outer plane in the core D&D 3e cosmology. A Man In Black 09:28, 30 May 2005 (UTC)
 * If they're in the official D&D cosmology I see absolutely no reason to delete this when we keep or merge nearly all other fictional places or characters. (Yeah yeah, I'm a "keep all fancruft" user.) Sjakkalle 11:33, 30 May 2005 (UTC)
 * Keep if they are official D&D cosomology as A Man In Black says. Kappa 20:36, 30 May 2005 (UTC)
 * Well, they're non-notable parts of official D&D cosmology. They might merit a single line each in a hypothetical Outer Planes (Dungeons and Dragons) article. A Man In Black 03:53, 31 May 2005 (UTC)
 * Merge. --Sn0wflake 23:31, 30 May 2005 (UTC)
 * Merge and redirect to Mt. Celestia. -Sean Curtin 03:23, May 31, 2005 (UTC)
 * Merge to the proposed Outer Planes (Dungeons and Dragons) or to Mt. Celestia, which in my opinion should be merged into such a higher-level article. Googling either "Lunia" or "Mercuria" gives many unrelated results such as Modigliani's Portrait of Lunia.  The D&D usages aren't among the high-ranked listings for either name, making me consider them not encyclopedically notable even if they weren't just gamecruft.  Barno 20:15, 31 May 2005 (UTC)

 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.

title: Wikipedia:Articles for deletion/Lunia


text:
Wikipedia:Articles for deletion/Attitude change

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was - kept - SimonP 02:20, Jun 15, 2005 (UTC)

Attitude change
Dictdef. --W(t) 07:23, 2005 May 30 (UTC)
 * Keep. Looks like a bit more than a dictdef and certainly has potential for expanding to an encyclopedic article. Sjakkalle 09:11, 30 May 2005 (UTC)
 * Delete. Dicdef, plus the meaning of the phrase is no more than the meaning of "attitude" and "change" composed.  Quale 16:00, 30 May 2005 (UTC)
 * Keep, a dictdef but could be expanded. UkPaolo 16:19, 30 May 2005 (UTC)
 * Keep. More than a dicdef. --Sn0wflake 23:33, 30 May 2005 (UTC)
 * Delete dicdef Denni ☯ 01:29, 2005 May 31 (UTC)
 * Merge/redir to attitude. Radiant_* 13:14, May 31, 2005 (UTC)
 * Keep and expand. Some potential. JamesBurns 09:01, 2 Jun 2005 (UTC)
 * Doesn't appear to have a potential for becoming encyclopedic. Wikipedia is not a dictionary, delete. - Mike Rosoft 13:32, 4 Jun 2005 (UTC)
 * Delete. Please explain how this can be turned into an encyclopedic article. I'm curious. Mandel 23:52, Jun 14, 2005 (UTC)
 * A lot could be added. Regarding the presence of this as a common plot twist in literature and movies, regarding the possible psychological origins of this change, regarding how this affects day-to-day life... there is quite a bit to be added to this article, still. --Sn0wflake 00:16, 15 Jun 2005 (UTC)

 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text:
Mel Stottlemyre

Melvin Leon Stottlemyre Sr. (November 13, 1941 – January 13, 2019) was an American professional baseball pitcher and pitching coach. He played for 11 seasons in Major League Baseball, all for the New York Yankees, and coached for 23 seasons, for the Yankees, New York Mets, Houston Astros, and Seattle Mariners. He was a five-time MLB All-Star as a player and a five-time World Series champion as a coach.

As a player (1964–1974)
Stottlemyre pitched in American Legion Baseball and attended Mabton High School in Mabton, Washington, and Yakima Valley Community College. A scout for the New York Yankees discovered Stottlemyre pitching for Yakima's baseball team, and signed him to a contract with no signing bonus on June 10, 1961. The Yankees assigned him to the Harlan Smokies of the Rookie-level Appalachian League. After appearing in eight games, the Yankees promoted him to the Auburn Yankees of the Class D New York–Penn League, and he appeared in seven games for Auburn.

Stottlemyre pitched to a 17–9 win–loss record and a 2.50 earned run average (ERA) with the Greensboro Yankees of the Class B Carolina League in 1962, and was promoted to the Richmond Virginians of the Class AAA International League in 1963. He alternated between starting and relieving for Richmond, before Ralph Houk, the Yankees' general manager, insisted that Stottlemyre be used exclusively as a starting pitcher. He recorded a 1.42 ERA in the 1964 season, the best in the International League.

Called up midseason in 1964, Stottlemyre went 9–3 to help the Yankees to their fifth consecutive pennant while being on the cover of The Sporting News. In the 1964 World Series, Stottlemyre faced Bob Gibson of the St. Louis Cardinals three times in the seven-game Series. Stottlemyre bested Gibson in Game 2 to even the series, and got a no-decision in Game 5, but lost the decisive Game 7 as the Cardinals won the Series.

Stottlemyre was named to the American League's (AL) roster for the 1965 Major League Baseball (MLB) All-Star Game, though he did not appear in the game. He won 20 games in the 1965 season, and led the AL with 18 complete games, 291 innings pitched, and 1,188 batters faced. He appeared in the 1966 MLB All-Star Game. He led the league with 20 losses. Stottlemyre won 20 games in the 1968 and 1969 seasons. He also started the 1969 MLB All-Star Game.

Stottlemyre threw 40 shutouts in his 11-season career, the same number as Hall of Fame lefty Sandy Koufax, which ties for 44th best all-time. Eighteen of those shutouts came in a three-season span from 1971–73. The Yankees released Stottlemyre before the 1975 season. Stottlemyre retired with 164 career wins and a 2.97 ERA.

Known as a solid-hitting pitcher, on July 20, 1965, Stottlemyre hit a rare inside-the-park grand slam. On September 26, 1964, he recorded five base hits in five at bats.

Coaching years (1984–2008)
In 1977, Stottlemyre re-emerged in baseball as a roving instructor for the Seattle Mariners. He spent five seasons in that position, and was hired by the New York Mets as their pitching coach in November 1983. In that role, he oversaw Dwight Gooden's National League Rookie of the Year and Cy Young Award seasons in 1984 and 1985. Stottlemyre served in the role for ten years (including the 1986 World Series championship team) and then followed that by serving a two-year stint as the Houston Astros pitching coach.

New York Yankees (1996–2005)
In 1996, Stottlemyre joined the Yankees coaching staff along with the incoming manager Joe Torre. Under Torre, Stottlemyre lowered the team ERA from 4.65 in 1996 to 3.84 in 1997. Under Stottlemyre, the Yankee team averaged an ERA of 4.23 from 1996 to 2005. The pitching staff was regarded as a major factor in the team's dynasty years, when they won four World Series Championships in five years.

After 10 seasons, Stottlemyre resigned his coaching position on October 12, 2005, following the Yankees' defeat in the 2005 American League Division Series by the Los Angeles Angels of Anaheim. He cited personal disagreements with Yankees owner George Steinbrenner among his reasons for leaving and cited Steinbrenner's comment that, after the division series was over, he had congratulated Angels manager Mike Scioscia. Stottlemyre's response was: "My first thought was, 'What about Joe?' Joe did a hell of a job, too. To congratulate the other manager and not congratulate your own, after what he's done this year, I laughed." The Yankees replaced Stottlemyre with former Yankees pitcher Ron Guidry.

Seattle Mariners (2008)
Stottlemyre was named pitching coach of the Seattle Mariners under manager John McLaren at the beginning of the 2008 season, and was retained by interim manager Jim Riggleman after McLaren's firing. He was dismissed after the season ended. Following the season, he retired from baseball.

Honors
The mayor of Mabton, Washington, declared October 12, 1964, to be "Mel Stottlemyre Day". He was inducted into the Washington State American Legion Baseball Hall of Fame in 2012. At Old-Timers' Day on June 20, 2015, the Yankees dedicated a plaque in Monument Park in Stottlemyre's honor.

Personal life
Stottlemyre was raised in the town of Mabton, Washington, located in the south-central part of the state. He resided with his wife, Jean, in Issaquah, Washington. Two of his sons, Todd and Mel Jr., followed their father by becoming major-league pitchers. His other son, Jason, died of leukemia at the age of 11.

Stottlemyre and John Harper coauthored an autobiography titled Pride and Pinstripes, published in 2007.

Stottlemyre was diagnosed with multiple myeloma in 2000. In remission for several years, he was an avid supporter of the Multiple Myeloma Research Foundation. The cancer reappeared in 2011. Stottlemyre died on January 13, 2019, at the age of 77, of cancer. To honor Stottlemyre, the Yankees wore black armbands on their uniform during the 2019 season.

title: Mel Stottlemyre


text: User talk:83.250.145.228

title: User talk:83.250.145.228


text:
New York Rock

New York Rock is an off-Broadway musical by avant-garde artist Yoko Ono. It is a fictionalised account of her marriage to songwriter and Beatle John Lennon. The musical contains many songs from Ono's albums throughout the years, as well as several new tracks, "Warzone" and "Where Do We Go from Here", which were reworked for inclusion on Rising.

Track listing
All songs written by Yoko Ono.
 * 1) "It Happened" (Mother) – 1:26
 * 2) "I'll Always Be with You" [*] – 2:27
 * 3) "Spec of Dust" – 2:09
 * 4) "Midsummer New York" – 1:58
 * 5) "What a Bastard the World Is" – 3:19
 * 6) "Loneliness" – 3:09
 * 7) "Give Me Something" – 1:21
 * 8) "Light on the Other Side" [*] – 1:58
 * 9) "Tomorrow May Never Come" – 1:54
 * 10) "Don't Be Scared" – 3:14
 * 11) "Growing Pain" – 2:37
 * 12) "Warzone" [*] – 1:41
 * 13) "Never Say Goodbye" – 4:17
 * 14) "O'Sanity" – 2:19
 * 15) "I Want My Love to Rest Tonight" – 4:15
 * 16) "I Felt Like Smashing My Face in a Clear Glass Window" – 3:04
 * 17) "Now or Never" – 3:20
 * 18) "We're All Water" – 3:04
 * 19) "Yes I'm Your Angel" – 2:44
 * 20) "It Happened" (Jill) – 1:28
 * 21) "Where Do We Go from Here" [*] – 2:02
 * 22) "Sleepless Night" – 2:00
 * 23) "No, No, No" – 1:34
 * 24) "Even When You're Far Away" – 3:02
 * 25) "Hell in Paradise" – 2:47
 * 26) "Toyboat" – 2:59
 * 27) "Story of an Oak Tree" [*] – 2:18
 * 28) "Goodbye Sadness" – 4:10
 * 29) "Never Say Goodbye" (Bill) [hidden track] – 4:23

([*] = new track)

Cast

 * Mother – Jan Horvarth
 * Little Bill/Boy – Sean Dooley
 * Bill – Pat McRoberts
 * Jill – Lynette Perry
 * Ignorance – Pete Herber
 * Violence – Walter O'Neil
 * Violence II – Paul Mahos
 * Streetkid – Aaron Blackshear
 * Streetkid – Peter Kim
 * Streetkid- Evan Ferrante

Singles

 * "Never Say Goodbye" (CD)

Songs not on the CD

 * "It Happened" (Bill)
 * "If Only" (Jill)

title: New York Rock


text:
Leaders of East Caprivi

East Caprivi was a Bantustan or "homeland" and later a second-tier authority in South West Africa during the apartheid period.

Political Affiliation

 * DTA - Democratic Turnhalle Alliance
 * SWAPO - South West Africa People's Organisation

title: Leaders of East Caprivi


text:
Talk:List of NP-complete problems

Protein Folding
What about protein folding? —Preceding unsigned comment added by 129.11.60.53 (talk) 16:11, 8 March 2008 (UTC)
 * What about it? If you want a proof that it's hard to do: http://www.cs.berkeley.edu/~christos/hp.ps 134.58.42.46 (talk) 12:37, 1 December 2010 (UTC)

Betweenness problem
The Betweenness problem, as defined in the article has a polynomial algorithm and therefore is in P. If it were an NP-Complete problem than P=NP. I think that there is a problem with the definitions, and the one that added the betweenness problem meant to other definition. Until the correct definition is found, I'll remove the problem from the list. APH 07:26, 30 May 2005 (UTC)
 * It does belong and should be added back; see SJ. Opatrny, Total ordering problem, SIAM J. Comput., 8 (1979), pp. 111–114. Problem is MS1 in Garey, M. R.; Johnson, D. S. (1979), Computers and Intractibility: a guide to the theory of NP-completeness, W.H. Freeman, according to http://acawiki.org/Total_ordering_problem Jodi.a.schneider (talk) 09:25, 5 October 2010 (UTC)
 * I no longer see betweenness on the list so I guess it was removed at some point, but it does belong (with the link JAS gave), and now has its own article; I will add it back. —David Eppstein (talk) 02:10, 20 August 2015 (UTC)

Vertex Covering
Google only finds the phrase "Covering by vertex cover" on this page, so I don't think that it is distinct from Vertex Cover. I removed it as a duplicate. James Aguilar 17:11, 29 November 2005 (UTC)

Copyright issues
According to Idea-expression divide:

 * If the book lists only facts, one might say that it is not original, but if the facts are selected and arranged in an original manner, the book may be copyrighted.

I've read elsewhere of an example where a book of recipes was copied and the copyright owner sued. The defendant claimed that the recipes were well-known simple lists of items not subject to copyright, but because the work copied even the organization and page numbering of the original, it was found to be in infringement.

Although I think "List of NP-complete problems" is an excellent article (especially as a source of new articles to write), I'm concerned that we may also be vulnerable to claims of copyright violation because we essentially steal the NP Guide's presentation. Maybe I should post to Copyright problems and see if they can decide if this is an issue? What do the original contributors think? Thanks. Deco 05:46, 28 November 2005 (UTC)

 * I took a course based on Garey & Johnson and the first thing I thought on seeing this article is that it's awfully close the the appendix of that book. I compared it with the actual book and, cosmetics aside, it's the same list organized in the same way, with the only difference being that G&J include descriptions of each problem. I not sure that it's definitely is a COPYVIO but the publishers could probably make a good case for it if they wanted to. In addition, given that the G&J is 30+ years old, the list severely needs to be updated anyway. I'd propose the following changes:
 * Remove the red links. Most of the problems in the list are from journal articles and probably don't meet WP notability guidelines, so it doesn't make sense to list them individually anyway.
 * Remove the organization and list the articles alphabetically. If people then want to re-organize it without referring to G&J or previous versions of the article. Then no one can complain that we're using G&J's organization.
 * If there are no objections I'll go ahead and make these changes in a few days. The COPYVIO process is painful and since the issue is borderline it would be better to resolve it with a few edits. RDBury (talk) 00:18, 4 August 2013 (UTC)

 * Have you-all considered the possibility that the book's appendix is a copy of our article? I found that such a reverse-Copyright violation had occurred in another article when someone suggested that a section of the article was a copy of part of a book. It turned out that the section in our article (the actual text which was alleged to be a copy) was older (by our revision history) than the book. JRSpriggs (talk) 09:51, 4 August 2013 (UTC)
 * The book was published, with its appendix, in 1979. —David Eppstein (talk) 16:13, 4 August 2013 (UTC)

Longest common subsequence
Is LCS NP-Complete problem? I think, that there exists simple polynomial algorithm, which solves this problem. Doesn't it? longest_common_subsequence

I was wondering the same thing, there is a linear dynamic programming algorithm to solve the LCS problem.

 * It is NP-complete in the general case of any number of input strings, not just two. Google is your best friend. Articles must be updated. Unfortunately I have no time now. mikka (t) 20:14, 27 March 2006 (UTC)
 * No it's not. If you have $$k$$ strings of length $$m$$, then you can find the longest subsequence common to all of them with a Dynamic Programming algorithm that takes $$O(m^2k)$$ time. This is polynomial in the input length. I've removed the link to LCS (besides, that article is a big mess, and doesn't even make mention of this $$k$$ strings problem.) -Shreevatsa 05:55, 7 May 2006 (UTC)
 * Shreevatsa, could you give a reference to that algorithm. There must be some hidden exponent, which is constant or even 1 for your setting. I took a look at the paper and it has a very reasonable reduction from vertex cover to LCS. --GrGr 11:02, 4 July 2006 (UTC)
 * I was wrong; I shouldn't have spoken without thinking it through. I couldn't get at that paper, but I tried to recall the algorithm I had in mind, and it is something entirely different (solves the longest common substring problem, for which of course, there are much better solutions than that). Sorry about that. (Which means I don't have a polynomial-time solution for the NP-complete problem? How shocking!) :)
 * At the same time, I think that it's not a good idea to link to the LCS page unless it mentions this (several strings) version. --Shreevatsa 13:01, 11 July 2006 (UTC)
 * I agree, that linking to longest_common_subsequence is not a good idea, if the article does not mention the problem described in Garey & Johnson. If I have some time, maybe I will improve the LCS article. (Btw I think, it would have been more shocking, if you actually had a polynomial-time algorithm :)) --GrGr 14:09, 11 July 2006 (UTC)
 * Yeah, ideally longest common subsequence would mention both variants and then we could link it (with an appropriate note attached). But that'll take a bit of effort. Deco 17:46, 11 July 2006 (UTC)

On harder-than-NP problems
Someone needs to go through and remove all of the PSPACE-complete, EXPTIME-complete, etc. problems; I have created List of PSPACE-complete problems to store the former. It might be desirable to also have List of EXPTIME-complete problems. So far I have only done the Games and Logic sections; I don't know that much about the rest (and probably made mistakes even in those sections). Ben Standeven 08:29, 30 January 2007 (UTC)

Finite state automata intersection not in NP
The page claims that "intersection of finite state automata" is NP-complete. I assume that this refers to the question whether or not such an intersection is empty. But this claim appears to be unfounded. For a fixed number of automata (such as 2), the problem is clearly in PTIME: just construct the intersection automaton. For polynomial number of automata, one can find an algorithm running in PSPACE: "guess" an accepted word letter by letter, show acceptance, and use Savitch's theorem to reduce NPSpace to PSpace. Indeed, this problem is reported to be PSPACE-complete in various sources:

 * The paper "PSPACE-completeness of Modular Supervisory Control Problems" (PS) states that the problem is PSpace complete, citing the following related sources:
 * D. Kozen. Lower bounds for natural proof systems. In Proc. 18th Symp. on the Foundations of Computer Science, pages 254–266, 1977.
 * M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
 * K.-J. Lange and P. Rossmanith. The emptiness problem for intersections of regular languages. In I. Havel, editor, Proc. of the 17th Conf. on Mathematical Foundations of Computer Science, number 629 in LNCS, pages 346–354. Springer-Verlag, 1992.
 * List of PSPACE-complete problems lists the problem with a question mark (which should probably be removed)
 * http://www.cs.mun.ca/~harold/Courses/Old/Ling6800.W06/Diary/index.html states that "Finite State Automata Intersection is PSPACE-complete (Garey and Johnson (1979), Problem AL6, p. 266)" where the cited source is "Garey, M.R., and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman; San Francisco, CA."

I thus removed automata intersection from the article. --Markus Krötzsch 09:33, 26 March 2007 (UTC)

 * You are absolutely right. I can reassure you that DFA intersection emptiness is PSPACE-complete, proved in (Kozen, 1977). Some introductory textbooks contain the fact that the problem is NP-hard (as exercise or theorem with proof), so possibly someone simply missed the difference between hardness and completeness. Hermel (talk) 22:08, 10 October 2008 (UTC)

 * Hermel, could you please list sources that say that the intersection emptiness problem is NP-hard because I was unable to find any. — Preceding unsigned comment added by Mikew72324 (talk • contribs) 22:35, 15 August 2011 (UTC)

Permuatation Flow shop problem
I'm looking at this problem for some work I'm doing and it is np-complete for more than 2 machines. I don't know if it is in the list under another name, but if not, it could be added to the list. Just a thought. —Preceding unsigned comment added by 71.63.82.192 (talk) 07:16, 24 September 2007 (UTC)

Games
The games section needs more explanation as to what part of the game is NP-Complete. For example, is the problem with Sudoku to find the possible number of solved puzzles, the possible number of solvable puzzles, or what? The Sudoku article mentions nothing about NP-Completeness (which is another thing, these things should all be mention in their respective articles). Asmeurer ( talk   ♬  contribs ) 18:26, 16 November 2008 (UTC)

 * The problem with Sudoku is to test whether a particular n-by-n (rather than 9-by-9) puzzle can be completed to a solution. However, NP-completeness is a bit of an issue because the usual reductions involve problems that may have multiple solutions while Sudoku puzzles are generally required to have exactly one. There's a workaround involving Valiant and Vazirani, "NP is as easy as detecting unique solutions" but it involves randomized Turing reductions rather than the usual many-one reductions. —David Eppstein (talk) 18:41, 16 November 2008 (UTC)

That's great. You should put that in this article/the sudoku article. I would do it, but I only understand about half of what you wrote, and I would either screw it up or have to copy-paste verbatim. Asmeurer ( talk   ♬  contribs ) 05:26, 17 November 2008 (UTC)

 * I don't have time to work on this tonight, but in case anyone else wants to take a crack, I wrote more on this three years ago on my blog (usual disclaimers about reliable sources and original research go here). —David Eppstein (talk) 05:53, 17 November 2008 (UTC)

Someone should indicate that the problem of finding a pure-strategy Nash equilibrium is NP-complete; I don't see that problem on this list. ~Phil —Preceding unsigned comment added by 66.28.35.109 (talk) 20:00, 14 October 2009 (UTC)

 * If each player has n choices, there are only n^2 pure strategy pairs to check, and each can be checked in linear time, so it's in P. Finding a mixed strategy equilibrium is also in P, using linear programming.  I vaguely recall there was some related problem that was difficult (maybe finding ALL mixed strategy equilibria?)  —Preceding unsigned comment added by 75.173.217.183 (talk) 06:26, 19 November 2010 (UTC)

I agree that some need some clarification. You're right on the sudoku one though, David. I'm a little curious about the Super Mario Bross one. What aspect of that one is NP-complete. I suspect it may only be on the list due to some vandalism.128.187.80.2 (talk) 23:10, 2 April 2013 (UTC)
 * I checked the source for SMB and it seems legit. An instance of a 'problem' consists of a level, i.e. platforms, obstacles, etc. The question is whether it's possible for Mario to get from the start of the level to the end. The authors claim that certain other Nintendo games are NP-hard. RDBury (talk) 03:12, 8 August 2013 (UTC)

Steiner tree
many of the problem titles in the section "spanning trees" which had no page seemed to be asking for the article []Steiner tree]] so I have directed them there. I am not certain that this is the best practice, but deleting them would likely lead to more confusion, and them being re-added later. Jasen betts (talk) 10:02, 3 September 2009 (UTC)

Actual reductions
Is there a website that features reductions used to prove hardness results, possibly using some graphical representation (i.e. edge-partitioning a graph is hard by reduction from 3SAT, which could be visualized by assigning vertex A to the former problem, vertex B to the latter, and directing an edge from B to A)? 134.58.42.46 (talk) 15:20, 20 October 2010 (UTC)

Non-trivial greatest common divisor
Non-trivial greatest common divisor links to Greatest common divisor of integers, which is clearly not np-hard. Euclids algorithm is a simple well known polynomial algorithm to compute the gcd. This should be clarified or removed from the list. — Preceding unsigned comment added by 46.14.248.115 (talk) 12:17, 20 December 2011 (UTC)

Shortest path computation
It can be solved by Dijsktra's algorithm which runs in polynomial time. So was is it listed as an NP-complete problem?2001:760:3403:FFFC:2C63:181F:461E:6DE3 (talk) 15:44, 18 February 2013 (UTC)

Quadratic Polynomials
I find this NP-complete problem to be of a different flavor than others listed here. I think it should be included. It is discussed in the paper by Manders and Adelman, "NP-complete decision problems for Quadratic Polynomials".

The problem is incredibly simple. Given positive integers $$A,B,C \geq 0$$. Find positive integers $$x,y$$ such that $$Ax^2+By-C=0$$.
 * I think it's rather $$A,B,C > 0$$. If $$A = 0$$, $$y = \frac{C}{B}$$, which is immediate. If $$B = 0$$, $$x = \sqrt{\frac{C}{A}}$$, which is immediate. If $$C = 0$$, $$x = 0$$ and $$y = 0$$. Morever, if y is positive, the problem is around $$O(min(\sqrt{\frac{C}{A}},\frac{C}{B}))$$, which is not NP-complete. If y can be negative, I think the problem is more difficult than NP-complete as the entries are infinite. Ftiercel (talk) 16:28, 9 November 2016 (UTC)

 * Since this was recently (2019) added again, it is worth pointing out that 's comments here are totally wrong: the numbers $$ \sqrt{\frac{C}{A}}, \frac{C}{B}$$ are exponential in the size of the input, so the naive algorithm implied by Ftiercel's comment runs in exponential time. (To say nothing of ignoring what appears to be the perfectly valid citation that accompanied the addition.)  --JBL (talk) 14:53, 6 December 2019 (UTC)

Games and Puzzles (Sudoku)
The statement currently in the list: "Testing whether a solved n × n Sudoku puzzle has a second solution." doesn't make sense to me and does not seem to match conclusions in the references. A discussion is here: User talk:David Eppstein. (I can move the discussion to this page if it is better). Thanks to anyone able to provide advise.—LithiumFlash (talk) 05:30, 9 April 2017 (UTC)

 * , the sentence in question both makes perfect sense and agrees with what is written in the reference. --JBL (talk) 13:39, 10 April 2017 (UTC)

 * JBL, That's fine. I'm not going to work on this list anymore. Just to let you know "Testing whether a solved n × n Sudoku puzzle has a second solution" does not make sense because a proper Sudoku never has more than one solution. Not as a puzzle, and not in its solved state (references can be found at the articles about Sudoku). Also, please be advised that other references were included with this entry, but were removed, which I believe is in contradiction to the policy on Conflicting sources. For more on this topic please see User talk:David Eppstein.—LithiumFlash (talk) 14:13, 10 April 2017 (UTC)

 * Yes, I have read that discussion -- everything David Eppstein and EEng have said there looks correct to me, including the fact that the sources you're adding do not seem to meet Wikipedia's standards for reliable sources. --JBL (talk) 16:16, 10 April 2017 (UTC)

 * Do you stand by the statement "Testing whether a solved n × n Sudoku puzzle has a second solution." is worded correctly for an entry in "List of NP-complete problems"?—LithiumFlash (talk) 16:31, 10 April 2017 (UTC)

 * I think it is both completely understandable and supported by a citation to a published paper. It doubt it would be hard to come up with a phrasing that is correct and didn't bother your sensibilities, but to do so would require a greater respect for sourcing than you seem to have, and perhaps a better understanding of the relevant mathematics. --JBL (talk) 18:25, 10 April 2017 (UTC)
 * Thank you. Here is some material for consideration (below). I'll let you and other editors decide if the entry in List of NP-complete problems should be revised. Of course you and others are also welcome to ammend or update the related knowledge in Sudoku and Mathematics of Sudoku. It won't bother me to see any of it changed (it was not me who placed the related statements in those articles). My only interest is that the text is supported by reliable sources.
 * http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/SIGAL87-2.pdf
 * http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/MasterThesis.pdf
 * https://www.cs.wmich.edu/elise/courses/cs431/icga2008.pdf
 * http://geevi.github.io/2014/puzzles.html
 * https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3468838/
 * Thank you for your support.—LithiumFlash (talk) 18:53, 10 April 2017 (UTC)

On TSP problems categorization
Aren't you think that Traveling salesman problem & Bottleneck traveling salesman problem must be in Graphs and hypergraphs category?!! — Preceding unsigned comment added by 41.248.23.77 (talk) 13:35, 8 July 2017 (UTC)

Art Gallery Problem
The Art Gallery Problem was removed altogether from this article. This might be an easy solution, but I don’t find the article sufficiently informative this way.

Because there is a common misconception, that the standard version is NP-complete, it would be better to clarify which version is and which versions are not NP-complete.

My suggestion looks like this:

Art Gallery Problem with vertex guards (Other versions - where the placement of guards is allowed anywhere in the polygon or on the boundary - are ExiatentialReal complete )

I can’t provide a citation that the vertex guard version is not only NP-hard but also compete, because in older publications all versions are falsely labelled as NP-complete. And to anyone in the field it is clear, that this problem is in NP, if you only allow vertex guards. Can anyone back me on this or should I explain it quickly?

Also could someone else please post that edit if agreed upon? JRellek (talk) 23:58, 17 December 2019 (UTC)
 * This is a list of NP-complete problems, not a list of problems that are complete for other classes that are hard for NP. It is indeed clear that it is in NP if you only allow vertex guards (you just have to cover all of the polynomially many regions of the visibility diagram of the candidate guard locations) but to include something like that we still need a source. Another problem here is that our art gallery article says nothing about NP-completeness of any variant. I think that problems listed here should go into more detail about the complexity in the linked article, and that is not currently true for this one. (It does discuss exists-R-completeness and NP-hardness, but not NP-completeness.) —David Eppstein (talk) 01:05, 18 December 2019 (UTC)

String to String correction is not NP-complete
Converting any string to another is Poly-time. (https://en.wikipedia.org/wiki/Levenshtein_distance) There is an extended version of the problem ( https://dl.acm.org/doi/10.1145/800116.803771 ) but the linked page (https://en.wikipedia.org/wiki/String-to-string_correction_problem) only mentions the standard problem. Suggestion>> Change the link to a stub extended string to string problem page with the reference (https://dl.acm.org/doi/10.1145/800116.803771)

R1CS constraint system
I would like to add R1CS constraint system to the list. what do you think? Jackzhp (talk) 11:32, 14 March 2021 (UTC)

Solving two-variable quadratic polynomials over the integers
This is included in the list but I think it is wrong. I'm not sure about this but what is NP-Complete is the decision version, otherwise factoring should also be NP-complete (which most likely is not) as solving second degree Diophantine equations is equal to factoring. Alperen (talk) 17:21, 11 February 2023 (UTC)

 * The first sentence of this list article is "This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems." Does that address your concern?  --JBL (talk) 18:50, 11 February 2023 (UTC)

title: Talk:List of NP-complete problems


text:
Te Rata Bridge

The Te Rata Bridge was a suspension bridge across the Retaruke River in the King Country, New Zealand. On 22 March 1994 two transoms (the supporting beams suspended from wire ropes running from side to side beneath the bridge) snapped causing the bridge to collapse while beekeeper Kenneth Richards was crossing in a laden light truck. Richards was killed when the truck fell 30 metres into the river.

Construction
The bridge was built on public land in 1986 for Keith and Margaret Berryman, a nearby landowner, by members of the New Zealand Army and a group of Fijian army trainees, as an exercise. The design was based upon calculations by Lieutenant John Armstrong, with labour and logistics for construction provided at New Zealand Army expense.

The Berrymans were to provide all materials, but instead of the specified macrocarpa or tanalised radiata pine timber for the transoms and bearers, they obtained Douglas fir timber from a demolition site in Wanganui. Lieutenant Armstrong's initial reaction was not to proceed with construction using deficient materials, but he was eventually persuaded when Keith Berryman signed a statement, witnessed by a neighbouring JP, taking responsibility for the materials and their subsequent inspection and maintenance. Loading was recalculated accordingly. Untreated Douglas fir timber has featured in the leaky homes saga around New Zealand; it is difficult to treat against decay and untreated timber is suitable for use only where it can be adequately protected from moisture. Te Rata receives about 1800 mm (72 in) of rainfall per year, and the river gorge is continuously damp with frequent fog.

Collapse
G. W. Butcher, a retired Lieutenant Colonel and civil engineer, who reported on the collapse for the army, concluded that the failure was caused by "50% reduction in the nominal strength of the member ... entirely due to decay of the untreated timber." Additional factors were "the decision to use two 300x75 beams bolted together for the transoms in place of a solid 300x150 member" and the lack of a "regular inspection and maintenance programme [...] by the owners of the bridge".

The army withheld Butcher's report from the 1997 inquest into Richards' death and kept its contents secret until it was published illegally on the internet by the Berrymans' lawyer, Rob Moodie. The Berrymans claim that their fight against attempts by the Occupational Safety and Health department to prosecute them for Richards' death has led to bankruptcy and the loss of their farm.

The complete text of the Butcher report is held at Butcher report. Its author could not previously comment publicly on its implications, but since its illegal distribution the Army has released the report. George Butcher has now spoken publicly and said Keith Berryman admitted to him that the transoms were in poor condition, that there was visible rot in some timbers, and that he was worried about the state of the bridge. Knowledge of an unsafe work environment and failure to prevent or isolate the risk is an offence in New Zealand, but the prosecution of the Berrymans failed when the judge ruled the bridge did not meet the definition of Mr Richards' place of work in the Health and Safety in Employment Act 1992.

Timeline of Te Rata bridges
The Berryman Bridge was the second suspension bridge to be the primary access to Te Rata. The earlier bridge, which collapsed around the 1980s, was a fearsome structure on the same site. In the 'Otago Born and Bred' articles noted below, this first bridge is referred to as the Hayes Bridge. The Hayes bridge, said to be 100 ft above the water, is understood by the Ruslings, still resident in the valley, to have been built by the Tichner brothers, formerly sailors, around 1915–1916. The cables consisted of bunches of 52 strands of No. 8 wire, and endured the whole life of the bridge, a period of at least 66 years. When the bridge finally collapsed under the weight of a mob of sheep, the uprights on the house side gave way, allowing the anchors to fall away. Evan and Bob Hayes, who were moving the sheep, were fortunately not on the bridge when it collapsed, but most of the sheep were either killed from the fall, or drowned in the Retaruke.
 * 1915–1916 Original bridge "Hayes bridge" constructed.
 * 1986 – Second bridge constructed.
 * 1994 – Bridge collapses.
 * 1997 – Inquest into collapse.
 * 2008, May – High Court quashes the parts of the 1997 finding by Taumarunui coroner that exonerated the Army, but stops short of exonerating the Berrymans
 * 2008, June – Berrymans seek damages from Defence Force at the Court of Appeal
 * 2008, 25 September – Court of Appeal decided Berryman's will have their claim of misfeasance heard.
 * 2009, 24 December – Berrymans accept Government settlement offer of $150,000.

title: Te Rata Bridge


text:
User:EricJay

I often use Wikipedia, and finally (May, 2005) decided to create an account so that I may contribute. I suspect most of my edits will be minor, at least at first. I am a resident of Boston, Massachusetts, grew up in Emerson, New Jersey, and have also lived in Washington, D.C. and New Orleans, Louisiana.

title: User:EricJay


text:
Wikipedia:Articles for deletion/Cloud N. Candy

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was - redirected - SimonP 02:25, Jun 15, 2005 (UTC)

Cloud N. Candy
Minor game character in Yoshi's Story. Only 88 Google hits. JamesBurns 07:28, 30 May 2005 (UTC)
 * Redirect to Yoshi's Story. A Man In Black 08:15, 30 May 2005 (UTC)
 * Redirect to the game. --Chill Pill Bill 23:23, 30 May 2005 (UTC)
 * Delete, not notable, games cruft. Megan1967 03:46, 4 Jun 2005 (UTC)
 * Delete not notable. Leanne 10:41, 9 Jun 2005 (UTC)

 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text: User talk:68.97.211.191

title: User talk:68.97.211.191


text: File:Yoko Ono NY Rock.jpg

title: File:Yoko Ono NY Rock.jpg


text: User talk:82.205.131.218

title: User talk:82.205.131.218