Complexity

Results: 8084



#Item
511Graph theory / Mathematics / Computational complexity theory / NP-hard problems / NP-complete problems / Edsger W. Dijkstra / Combinatorial optimization / Approximation algorithms / Travelling salesman problem / Shortest path problem / Matching / Randomized algorithm

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Add to Reading List

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

Language: English - Date: 2016-01-03 06:48:33
512Circuit complexity / NC / Big O notation / Mathematics / Theoretical computer science / Computer science

Counting in the Presence of Memory Faults Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1 , Gabriel Moruz2,? , and Thomas Mølhave3,?? 1 2

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-07-24 06:57:56
513Algebra / Mathematics / Numerical linear algebra / Linear algebra / Functional analysis / Statistical classification / Dimension reduction / Kernel / Support vector machine / Matrix / Low-rank approximation / Reproducing kernel Hilbert space

JMLR: Workshop and Conference Proceedings vol 40:1–29, 2015 On the Complexity of Learning with Kernels Nicol`o Cesa-Bianchi NICOLO . CESA - BIANCHI @ UNIMI . IT

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:35
514Mathematics / Mathematical analysis / Dimension theory / Geometry / Fractals / Metric geometry / Effective dimension / Kakeya set / Hausdorff dimension / MinkowskiBouligand dimension / Kolmogorov complexity / Limit of a function

Algorithmic information, plane Kakeya sets, and conditional dimension Jack H. Lutz∗ Neil Lutz†

Add to Reading List

Source URL: paul.rutgers.edu

Language: English - Date: 2016-02-16 15:07:26
515Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Graph connectivity / Combinatorial optimization / Cut / Approximation algorithm / Randomized algorithm / Independent set / Semidefinite programming / Randomized rounding

arXiv:1110.4319v2 [cs.DS] 20 Oct 2011

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-10-20 20:42:54
516Analysis of algorithms / Online algorithms / Finite fields / Computer science / Computational complexity theory / XTR / List update problem / Competitive analysis / Applied mathematics

Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:04
517Computational complexity theory / Operations research / Mathematics / Theory of computation / Mathematical optimization / Optimization problem / Algorithm / Time complexity / Evolutionary multimodal optimization / Global optimization

VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

Add to Reading List

Source URL: www.vsgc.odu.edu

Language: English - Date: 2013-05-02 13:43:42
518Cryptography / Zero-knowledge proof / IP / Distribution / Computational complexity theory / Interactive proof system / Proof of knowledge

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-07-07 05:51:55
519Probability / Markov models / Probabilistic complexity theory / Markov processes / Statistics / Graph theory / Markov chain / Randomized algorithm / Stochastic process / Algorithm / Catalog of articles in probability theory

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:29
520Sorting algorithms / Computing / Data processing / Mathematics / Algorithm / Mathematical logic / Theoretical computer science / Sorting / Sort / Computational complexity theory / Program optimization / Selection algorithm

A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri

Add to Reading List

Source URL: spcl.inf.ethz.ch

Language: English - Date: 2014-09-17 16:23:24
UPDATE