Most SNP

View of the pylon and "UFO"

Most Slovenského národného povstania (English: Bridge of the Slovak National Uprising), commonly referred to as Most SNP or the UFO Bridge, and named Nový most (English: New Bridge) from 1993 to 2012, is a road bridge over the Danube in Bratislava, the capital of Slovakia. It is the world's longest cable-stayed bridge to have one pylon and one cable-stayed plane.

It is an asymmetrical cable-stayed bridge with a main span length of 303 m (994 ft). Its steel construction is suspended from steel cables, connected on the Petržalka side to two pillars. The total length of the bridge is 430.8 m (1,413 ft), its width 21 m (69 ft), and it weighs 537 t (592 short tons).

A special attraction is the flying saucer-shaped structure housing a restaurant, which since 2005 has been called UFO (previously, Bystrica), on the bridge's 84.6 m (278 ft) pylon. The restaurant is reached using an elevator located in the east pillar, and offers a good view over Bratislava. The west pillar houses an emergency staircase with 430 stairs. Nový Most has four lanes for motor traffic on the upper level and lanes for bicycles and pedestrians on the lower level.

SNP

SNP may refer to:

Politics

Companies

Science

Computing

Places

Others

SNP (complexity)

In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph-theoretical properties. It forms the basis for the definition of the class MaxSNP of optimization problems.

One characterization of the NP complexity class, as shown by Ronald Fagin in 1974 and related to Fagin's theorem, is that it is the set of problems that can be reduced to properties of graphs expressible in existential second-order logic. This logic allows universal (∀) and existential (∃) quantification over vertices, but only existential quantification over sets of vertices and relations between vertices. SNP retains existential quantification over sets and relations, but only permits universal quantification over vertices.

SNP contains k-SAT, the boolean satisfiability problem (SAT) where the formula is restricted to conjunctive normal form and to at most k literals per clause, where k is fixed.

MaxSNP