LA-URTheory Component of the Quantum Information Processing

Source URL: qist.lanl.gov

• Quantum information science
• Quantum computing
• Quantum cryptography
• Emerging technologies
• Theoretical computer science
• Quantum complexity theory
• Quantum information
• Quantum algorithm
• BQP
• Quantum entanglement
• Quantum key distribution
• Umesh Vazirani

Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic II: the four-element case

Source URL: www.bedewell.com

• Complexity classes
• Finite model theory
• Computational complexity theory
• Descriptive complexity
• Structural complexity theory
• FO
• SO
• P versus NP problem
• NP
• P
• Reduction
• HO

The size and complexity of modern datasets has far outstripped the capabilities of common existing methods for visualization. Current tools work well for small numbers of data points, where each point is represented by m

Source URL: mmds-data.org

• Visualization
• Bioinformatics
• Infographics
• Computational science
• Computer graphics
• Heat map

Additively efficient universal computers Daniel Dewey∗ Oxford Martin Programme on the Impacts of Future Technology, Future of Humanity Institute

Source URL: www.danieldewey.net

• Turing machine
• Computability theory
• Theory of computation
• Models of computation
• Alan Turing
• Universal Turing machine
• Turing completeness
• Kolmogorov complexity
• Computational complexity theory
• ChurchTuring thesis
• Cellular automaton
• Computer

On the Complexity of Computing Units in a Number Field V. Arvind and Piyush P Kurur Institute of Mathematical Sciences C.I.T Campus,Chennai, India {arvind,ppk}@imsc.res.in

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

• Complexity classes
• Algebraic number theory
• Polynomials
• Circuit complexity
• NC
• NP
• Lattice
• Algebraic number field
• Jordan normal form
• Discriminant of an algebraic number field

The Unicist Approach: A Paradigm Shift in Sciences based on the Unicist Theory

Source URL: www.unicist.org

• Systems
• Complex systems theory
• Epistemology of science
• Biological evolution
• Epistemology
• Peter Belohlavek
• Complex systems
• Paradigm shift
• Science
• Complexity
• Paradigm
• Ontology

PRESS RELEASE Banks and Credit Unions Should Address Technology Complexity with More—Not Less—Technology, Report Suggests SCOTTSDALE, Ariz., August 19, 2015 – A new research report from management consulting firm

Source URL: www.crnrstone.com

Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011

Source URL: disco.ethz.ch

• Analysis of algorithms
• Balls into bins
• With high probability
• Randomized algorithm
• Time complexity
• Chernoff bound
• Maximal independent set
• EdmondsPruhs protocol

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann†

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

• Triangulation
• Analysis of algorithms
• Computational complexity theory
• Time complexity
• Big O notation
• NC
• Matching
• Algorithm
• Minimum-weight triangulation
• Planar separator theorem

CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015

Source URL: theory.stanford.edu

• Game theory
• Computational complexity theory
• Quantum complexity theory
• Complexity classes
• Decision theory
• Nash equilibrium
• Price of anarchy
• Exponential time hypothesis
• Circuit complexity
• Communication complexity
• Algorithmic game theory
• PP