Tag: cc.complexity-theory

Found 1315 results for 'cc.complexity-theory'.

1) cc.complexity-theory - NP-hard problems on trees
2) cc.complexity-theory - Subexponentially solvable hard graph problems
3) cc.complexity-theory - Minimum weight subforest of given cardinality
4) cc.complexity-theory - P-complete problems on trees
5) cc.complexity-theory - NP-complete problems with optimal approximation in poly-time
6) cc.complexity-theory - Easy to optimize but hard to evaluate
7) cc.complexity-theory - Logspace algorithms on graphs with bounded tree width
8) cc.complexity-theory - Complexity of counting poset automorphisms
9) cc.complexity-theory - Relationship between symmetry and computational intractability?
10) cc.complexity-theory - An interesting variant of maximum matching problem
11) cc.complexity-theory - Treewidth and the NL vs L Problem
12) cc.complexity-theory - Is it $NP$-complete to decompose bridgeless cubic bipartite graph into edge-disjoint paths of length 3?
13) cc.complexity-theory - Natural CLIQUE to k-Color reduction
14) cc.complexity-theory - Can graph isomorphism be decided with square root bounded nondeterminism?
15) cc.complexity-theory - Complexity of Multi-colored Clique when every color pair induce biclique+isolated vertices
16) cc.complexity-theory - Hardness of parameterized CLIQUE?
17) cc.complexity-theory - Partition a graph into node-disjoint cycles
18) cc.complexity-theory - SERF-reducibility and subexponential algorithms
19) cc.complexity-theory - NP-intermediate problems with efficient quantum solutions
20) cc.complexity-theory - Classes of graphs with easy Hamiltonian cycle but NP-hard TSP
21) cc.complexity-theory - Complexity of edge coloring in planar graphs
22) cc.complexity-theory - Minimum vertex cover on k-regular graphs, for fixed k>2 NP-hard proof?
23) cc.complexity-theory - Can a natural graph problem be universally hard?
24) cc.complexity-theory - Lexicographically minimal topological sort of a labeled DAG
25) cc.complexity-theory - Isomorphism of ‘ordered’ DAGs / acyclic semiautomata
26) cc.complexity-theory - #P-complete problems are at least as hard as NP-complete problems
27) cc.complexity-theory - Hard extendability problems
28) cc.complexity-theory - Density of P-complete languages
29) cc.complexity-theory - Ranking the Difficulty of NP Hard Problems in Practice
30) cc.complexity-theory - Hardness of approximation - additive error
31) cc.complexity-theory - What do you call the join of two optimization problems?
32) cc.complexity-theory - Non-rooted MST of directed graph
33) cc.complexity-theory - NP completeness of classes of spanning trees
34) cc.complexity-theory - Is there a natural problem on the naturals that is NP-complete?
35) cc.complexity-theory - Schaefer's theorem and CSPs of unbounded width
36) cc.complexity-theory - SAT Solution Space - Definition of Cluster of Solutions
37) cc.complexity-theory - Examples where the uniqueness of the solution makes it easier to find
38) cc.complexity-theory - Generating a tower defense maze, aka Finding the K most vital nodes ("nodewise interdiction") in an unweighted grid-graph
39) cc.complexity-theory - Is bounded-width SAT decidable in logspace?
40) cc.complexity-theory - TSP in bounded tree-width (or bounded branch width) graphs
41) cc.complexity-theory - What is the complexity of this path problem?
42) cc.complexity-theory - Graph problems which are NP-Complete on directed graphs but polynomial on undirected graphs
43) cc.complexity-theory - Maximum number of geometrically disjoint paths - is the complexity known?
44) cc.complexity-theory - H-free cut problem
45) cc.complexity-theory - Minimum Parity Weight Path - what is the complexity?
46) cc.complexity-theory - How expensive may it be to destroy all long s-t paths in a DAG?
47) cc.complexity-theory - Trade off between width and depth of free BDDs for total functions
48) cc.complexity-theory - Recognizing line graphs of hypergraphs
49) cc.complexity-theory - Complexity of testing if a hypergraph has generalized hypertreewidth $2$
50) cc.complexity-theory - Learning with (Signed) Errors