Microsoft WordMIESTAMO.doc

Source URL: www.ling.helsinki.fi

• Grammar
• Linguistics
• Semantics
• Phonology
• Philosophy
• Academia
• Affirmative and negative
• Truth
• Negation
• Complexity
• Language complexity
• FO

LNCSBatch Proofs of Partial Knowledge

Source URL: homes.soic.indiana.edu

• Cryptography
• Mathematics
• Computational complexity theory
• Proof theory
• Zero-knowledge proof
• Proof of knowledge
• IP
• Soundness
• Distribution

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Source URL: tandy.cs.illinois.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP-complete problems
• Combinatorial optimization
• Packing problems
• Approximation algorithms
• Knapsack problem
• NP
• APX

Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨

Source URL: people.mpi-inf.mpg.de

• Mathematical optimization
• Computational complexity theory
• Theory of computation
• Applied mathematics
• Academia
• Evolutionary algorithms
• Operations research
• Cybernetics
• Multi-objective optimization
• Reduction
• Algorithm
• CMA-ES

A Bibliometric Test of the Hierarchy of the Sciences: Preliminary Results Daniele Fanelli* and Wolfgang Glänzel** * ISSTI-The University of Edinburgh, Old Surgeons’ Hall, Edinburgh, EH1 1LZ

Source URL: www.sticonference.org

• Knowledge
• Academia
• Hardness tests
• Information science
• Hard and soft science
• Philosophy of science
• Library science
• Discipline
• Hardness
• Bibliometrics
• Complexity
• Web of Science

On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

Source URL: kam.mff.cuni.cz

• Graph theory
• Graph operations
• Graph coloring
• Matroid theory
• Edge contraction
• Graph
• Bipartite graph
• Ear decomposition
• Pathwidth
• Line graph

A SUMMARY OF MY RESEARCH (MARCHJ.M. LANDSBERG I have wide research interests: Cartan style differential geometry, classically influenced algebraic geometry, the geometry of homogeneous varieties, categorical gener

Source URL: www.math.tamu.edu

• Algebra
• Mathematics
• Linear algebra
• Tensor
• Algebraic geometry
• Differential geometry
• Graduate Studies in Mathematics
• Rank
• Matrix
• Determinant
• Lie group
• Geometric complexity theory

Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Matching
• Combinatorial optimization
• Dominating set
• Vertex cover
• Transportation theory
• Distribution

Complexity Issues in Bivariate Polynomial Factorization A. Bostan G. Lecerf B. Salvy

Source URL: www.csd.uwo.ca

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

Source URL: community.dur.ac.uk

• Computational complexity theory
• Theory of computation
• Mathematics
• Complexity classes
• Computational problems
• Theoretical computer science
• Structural complexity theory
• Tutte polynomial
• NP
• Quantum computing
• Time complexity
• Reduction