Complete theory

Results: 1780



#Item
991Graph partition / Graph / Hypergraph / Adjacency matrix / Topology / Line graph / Graph theory / Mathematics / NP-complete problems

Sparse Matrix Partitioning for Parallel Eigenanalysis of Large Static and Dynamic Graphs

Add to Reading List

Source URL: www.ieee-hpec.org

Language: English - Date: 2014-08-25 20:44:10
992NP-complete problems / Analysis of algorithms / Matroid theory / Parameterized complexity / Complexity classes / Clique problem / Vertex cover / Time complexity / Matroid / Theoretical computer science / Computational complexity theory / Mathematics

Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2006-01-19 05:18:59
993Child protection / Attachment theory / Child care / Special education / Behavior / Education / Personal life

CD ICPC[removed]INTERSTATE COMPACT ON THE PLACEMENT OF CHILDREN (ICPC) RECEIVING STATE’S PRIORITY HOME STUDY PURPOSE: Form CD ICPC 102 is used to complete a Priority Home Study in the time specified.

Add to Reading List

Source URL: dss.mo.gov

Language: English - Date: 2014-04-24 00:23:19
994Graph / Tree / NP-complete problems / Spanning tree / Graph partition / Planar separator theorem / Graph theory / Mathematics / Theoretical computer science

PDF Document

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2011-11-04 11:56:54
995Logical syntax / Automated theorem proving / Proof theory / Model theory / Theorem / Mathematical proof / TeX / First-order logic / Unification / Logic / Mathematics / Mathematical logic

TUGboat, Volume[removed]), No[removed]ProofCheck: Writing and checking complete proofs in LATEX

Add to Reading List

Source URL: www.tug.org

Language: English - Date: 2009-09-26 12:32:25
996NP-complete problems / Spanning tree / Line graph / Time complexity / Planar graph / Graph partition / Minor / Trapezoid graph / Eulerian path / Graph theory / Theoretical computer science / Mathematics

Approaching Optimality For Solving SDD Linear Systems Ioannis Koutis Carnegie Mellon University Email: [removed] Gary L. Miller

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2010-08-23 12:08:01
997NP-complete problems / Matching / Combinatorial optimization / Hypergraph / 3-dimensional matching / Graph / Line graph / Vertex cover / Graph theory / Mathematics / Theoretical computer science

Probabilistic Graph and Hypergraph Matching Ron Zass and Amnon Shashua School of Computer Science and Engineering The Hebrew University of Jerusalem zass,[removed]

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2008-04-08 07:15:41
998NP-complete problems / Graph coloring / Network topology / Networks / Wireless networking / Unit disk graph / Routing / Distributed computing / Mesh networking / Graph theory / Theoretical computer science / Mathematics

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 12,

Add to Reading List

Source URL: sensorweb.cs.gsu.edu

Language: English - Date: 2013-04-05 09:44:29
999NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Conjunctive normal form / Local search / PP / NP-complete / Theoretical computer science / Computational complexity theory / Applied mathematics

The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2007-10-29 20:04:40
1000NP-complete problems / Graph coloring / Clique / Graph operations / Independent set / Clique problem / Line graph / Graph theory / Theoretical computer science / Mathematics

Derandomized Graph Products Noga Alon ∗ Uriel Feige†

Add to Reading List

Source URL: www.tau.ac.il

Language: English - Date: 2002-02-21 20:23:30
UPDATE