I t{rqrrEr;r Er{kd kfi.rtt +fi frftq egqr +.rqf{q

Source URL: swbbl.com.np

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Source URL: pagesperso.lina.univ-nantes.fr

• Complexity classes
• NP-hardness
• NP
• P versus NP problem
• Computational complexity theory
• P
• Reduction

NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗

Source URL: cqi.inf.usi.ch

• Computational complexity theory
• Complexity classes
• Quantum computing
• Theoretical computer science
• Mathematical optimization
• Quantum algorithm
• NP
• P versus NP problem
• BQP
• PP
• Low
• Time complexity

QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011.

Source URL: www.bedewell.com

• Complexity classes
• NP-hardness
• IP
• PSPACE-complete
• NP
• Reduction
• PSPACE
• P
• FO
• Circuits over sets of natural numbers
• True quantified Boolean formula

Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm Xiao Zhang⋆ △ and Baojun Qiu⋆⋄ and Prasenjit Mitra⋆† and Sen Xu‡ and Alexander Klippel‡ and Alan M. MacEach

Source URL: cognitivegiscience.psu.edu

• Network theory
• Routing algorithms
• Edsger W. Dijkstra
• Graph connectivity
• NP-complete problems
• Shortest path problem
• Distance
• Path
• Longest path problem
• K shortest path routing
• FloydWarshall algorithm

Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5

Source URL: pbil.univ-lyon1.fr

• Complexity classes
• Flux balance analysis
• NP
• Matrix
• Matching
• Hamiltonian path problem
• Sharp-P-complete
• Hypergraph
• Computational complexity theory
• Stoichiometry
• P
• Bipartite graph

Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios ·

Source URL: community.dur.ac.uk

• NP-complete problems
• Interval graph
• Strongly chordal graph
• Hamiltonian path
• Longest path problem
• Chordal graph
• Indifference graph
• Permutation graph
• Path
• Pathwidth
• Graph minor

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

Source URL: www.cse.iitk.ac.in

• Complexity classes
• Finite groups
• Combinatorial group theory
• Graph isomorphism problem
• Morphisms
• Hidden subgroup problem
• Permutation group
• Permutation
• Graph canonization
• ArthurMerlin protocol
• Graph automorphism
• NP

Štandardizovaný názov národného parku (NP) (skratka) Národný park Malá Fatra Národný park Muránska planina Národný park Nízke Tatry (NAPANT) Národný park Poloniny

Source URL: www.skgeodesy.sk

Strategija razvoja održivog turizma na širem području Nacionalnog parka Kornati __________________________________________________________________________________ Strategija razvoja održivog turizma na širem područ

Source URL: np-kornati.hr