Complexity - PDFSEARCH.IO - Document Search Engine

Complexity
Results: 8084

#	Item
711	MCS 441 – Theory of Computation I Syllabus Lev Reyzin SpringTime and Location: M-W-F, 12:00-12:50pm, Lincoln Hall (TH) 205 Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-01-11 11:14:04 Theory of computation Theoretical computer science Computability theory Computer science Alan Turing Turing machine Computational complexity theory Computability Reduction Halting problem Complexity ChurchTuring thesis
712	J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005 SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University Add to Reading List Source URL: www.openu.ac.il Language: English - Date: 2007-10-29 03:55:14 Finite automata Computability Deterministic automaton Computational complexity theory Deterministic finite automaton Finite-state machine Regular language Reduction Algorithm Theoretical computer science Mathematics Cognitive science
713	Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi Add to Reading List Source URL: gswc.cs.ucsb.edu Language: English - Date: 2016-03-01 02:43:37 Computational complexity theory Software metrics Software engineering Theory of computation Complexity classes Cyclomatic complexity Software testing Structural complexity theory Control flow graph Complexity Code coverage PL
714	De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:27 Mathematics Graph theory Computational complexity theory Combinatorial optimization Matching Degree Connectivity Draft:Sub-linear time algorithm Planar separator theorem
715	Algorithmica: 67–80 DOI: s00453Algorithmica © Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2002-07-02 08:00:25 Computational complexity theory Theory of computation Algorithms Theoretical computer science Analysis of algorithms Probabilistic complexity theory Streaming algorithm Property testing Randomized algorithm Sequence NC Sampling
716	A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom) Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2016-04-12 05:51:20 Computational complexity theory Theory of computation Mathematics Operations research Complexity classes Mathematical optimization Structural complexity theory Theoretical computer science NP Linear programming Algorithm Reduction
717	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
718	On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira Add to Reading List Source URL: www.dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:56 Theory of computation Complexity classes Mathematics Theoretical computer science Valuation Submodular set function NC NP Reduction P/poly
719	Reducing the Representation Complexity of Lattice-Based Taxonomies Sergei Kuznetsov1,2 , Sergei Obiedkov1,2 , and Camille Roth3,4 1 Higher School of Economics, Moscow, Russia Add to Reading List Source URL: camille.roth.free.fr Language: English - Date: 2007-07-29 16:14:30 Algebra Mathematics Abstract algebra Lattice theory Data mining Formal concept analysis Machine learning Ontology Lie groups Lattice Dual Algebraic structure
720	The Maximum Hypervolume Set Yields Near-optimal Approximation Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:08 Computational complexity theory Mathematical optimization Multi-objective optimization Base Approximation algorithms Mathematics

UPDATE