The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars Makoto Kanazawa and Sylvain Salvati 1

Source URL: research.nii.ac.jp

• Complexity classes
• Type theory
• Categorial grammar
• Theoretical computer science
• NP
• Grammar
• P
• Mathematics
• Washington State Judicial election
• 18th South African Parliament

• OK CouverturesGP P/GP NP:01 Page 1 Pages 5 à 7 Mode d’emploi du guide et liste des portraits

Source URL: www.repop-fc.com

Liefer- und Zahlungsbedingungen Online-Shop Nationalpark Thayatal Stand: JuniLieferung Alle Lieferungen erfolgen grundsätzlich auf Rechnung und Gefahr des Käufers. Beanstandungen an Lieferungen können wir nu

Source URL: www.np-thayatal.at

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar

Source URL: www.math.tamu.edu

• Algebra
• Mathematics
• Linear algebra
• Algebraic geometry
• Differential geometry
• Functional analysis
• Multilinear algebra
• Grassmannian
• Exterior algebra
• Vector space
• NP
• Linear form

लोक सेवा आयोग (लललित परीक्षा नलतजा प्रकाशन शािा) सूचना नं. ४० /०७३/७४

Source URL: www.psc.gov.np

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2

Source URL: community.dur.ac.uk

• Graph theory
• NP-complete problems
• Longest path problem
• Interval graph
• Hamiltonian path
• Independent set
• Chordal graph
• Indifference graph
• Path
• Permutation graph
• Pathwidth
• Graph coloring

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• NP-complete problems
• Boolean algebra
• Parameterized complexity
• Boolean satisfiability problem
• Constraint satisfaction problem
• Exponential time hypothesis
• Treewidth
• Tree decomposition

A semidefinite programming hierarchy for geometric packing problems David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Isaac Newton Institute for Mathematical Sciences – July 2013

Source URL: www.daviddelaat.nl

• Graph theory
• NP-complete problems
• Discrete geometry
• Independent set
• FranklRdl graph
• Lovsz number

J EPSILON Pi Mu Epsilon Journal Volume 2—Reprint

Source URL: www.pme-math.org

• Mathematics
• Graph theory
• Economy
• Operations research
• Matching
• Combinatorial optimization
• NP-complete problems
• Assignment problem
• Linear programming
• Transportation theory
• Inventory
• Travelling salesman problem

Mouton de Gruyter | Linguistic Typology) | 1st proofs Michael Cysouw - Dealing with diversity: Towards an explanation of NP-internal word order frequencies Please note: Page- and linebreaks are t

Source URL: cysouw.de

• Syntax
• Linguistics
• Grammar
• Cognitive science
• Syntactic categories
• Parts of speech
• Linguistic typology
• Noun phrase
• Word order
• Phrase
• Noun
• Language