Share on Facebook Share on Twitter Email
Answers.com

UP

 
Artist: The Up

Group Members:

Scott Bailey, Vic Peraino, Bob Rasmussen, Frank Bach, Gary Rasmussen

Similar Artists:

The Stooges, MC5, David Peel & the Lower East Side, The Fugs

Formal Connection With:

  • Genres: Rock
  • Representative Albums: "Killer Up

Biography

Ann Arbor, Michigan-based proto-punks the Up were formed in the spring of 1967 by vocalist Franklin Bach, then the stage manager and announcer at Detroit's famed Grande Ballroom. Rounded out by guitarist Bob Rasmussen, bassist Gary Rasmussen and drummer Vic Peraino (soon replaced by Scott Bailey), the group was managed by David Sinclair, the brother of local White Panther Party leader John Sinclair, and as such their history became inextricably linked with that of local revolutionary rockers the MC5, with the two bands even living together at the same Ann Arbor commune. The Up regularly opened for the MC5 as well, and were the opening act at the legendary September 1968 show at the Union Ballroom that so impressed Elektra Records president Jac Holzman that he offered a contract not only to the Five but also the second act on the bill, the Stooges; as both groups went on to national notoriety, the Up remained mired on the regional circuit, becoming the primary musical outlet for the White Panthers' propaganda after the MC5 broke away from the party. Finally, in 1970 the Up recorded their debut single "Just Like an Aborigine," a blistering cut similar in sound and spirit to the punk records which emerged from Britain at the end of the decade; a second single, "Free John Now!" -- a rallying cry in honor of the imprisoned Sinclair -- followed a year later. Although the group disbanded in 1973 -- Gary Rasmussen later resurfaced in Sonic's Rendezvous Band -- they left behind enough material for a 1995 retrospective LP, Killer Up! ~ Jason Ankeny, All Music Guide
Search unanswered questions...
Enter a question here...
Search: All sources Community Q&A Reference topics
Wikipedia: UP (complexity)
Top

In complexity theory, UP ("Unambiguous Non-deterministic Polynomial-time") is the complexity class of decision problems solvable in polynomial time on a non-deterministic Turing machine with at most one accepting path for each input. UP contains P and is contained in NP.

A common reformulation of NP states that a language is in NP if and only if a given answer can be verified by a deterministic machine in polynomial time. Similarly, a language is in UP if a given answer can be verified in polynomial time, and the verifier machine only accepts at most one answer for each problem instance. More formally, a language L belongs to UP if there exists a two input polynomial time algorithm A and a constant c such that

if x in L , then there exists a unique certificate y with |y| = O(|x|c) such that A(x,y) = 1
if x isn't in L, there is no certificate y with |y| = O(|x|c) such that A(x,y) = 1

Algorithm A verifies L in polynomial time.

UP (and its complement co-UP) contain the integer factorization problem; because determined effort has yet to find a polynomial-time solution to this problem, it is suspected to be difficult to show P=UP, or even P=(UPco-UP).

The famous Valiant-Vazirani theorem states that NP is contained in RPPromise-UP, which means that there is a randomized reduction from any problem in NP to a problem in Promise-UP.

UP is not known to have any complete problems.[1]

References


Shopping: UP
Top
 
 
Learn More
Johnsen, William H. (Quotes By)
volute
up (Idiom)

How do you get it up? Read answer...
What is what's up? Read answer...
What is the UPS? Read answer...

Help us answer these
What does what up?
Not on the up and up?
Are you a up?

Post a question - any question - to the WikiAnswers community:

 

Copyrights:

Artist. Copyright © 2009 All Media Guide, LLC. Content provided by All Music Guide ®, a trademark of All Media Guide, LLC. All rights reserved.  Read more
Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "UP (complexity)" Read more