Tag: polynomial-time
Found 41 results for 'polynomial-time'.
1) cc.complexity-theory - For which k is PLANAR NAE k-SAT in P?
2) cc.complexity-theory - polytime transformation from a graph to a set of binary strings
3) cc.complexity-theory - Complexity of a satisfiability problem
4) cc.complexity-theory - Complexity of finding Exact Size Cut-Sets in Bipartite Graphs
5) cc.complexity-theory - NP-hardness of a special case of Number Partitioning
6) time-complexity - Examples of problems where exponential algorithms run faster than polynomial algorithms for practical sizes?
7) ds.algorithms - How fast can we solve a totally unimodular integer linear program?
8) cc.complexity-theory - Why is 2SAT in P?
9) polynomial-time - Two extremely naive questions about the Kronecker problem from Geometric Complexity Theory
10) cc.complexity-theory - What are the consequences of $P \subseteq L/poly$?
11) graph-theory - Given a 4-cycle free graph $G$, can we determine if it has a 3-cycle in quadratic time?
12) space-bounded - Can $\{a^nb^n\}$ be recognized in poly-time probabilistic sublogarithmic-space?
13) cc.complexity-theory - Are there more polynomial time problems with complexity lower bounds?
14) ds.algorithms - Young Diagrams and distinguishing between two distributions
15) sat - Counting the number of satisfying assignments in a POSITIVE CNF-SAT
16) cc.complexity-theory - On sparse complete sets and P vs L
17) cc.complexity-theory - Finding a prime greater than a given bound
18) cc.complexity-theory - What is the conjectured relationship between P (PTime) and Type 1 (context-sensitive) languages?
19) reference-request - Which Integer Linear Programs are easy?
20) optimization - 3-SAT runtime if an optimal order to eliminate possible solutions is known
21) cc.complexity-theory - Can MONOTONE WSAT be in solved in polynomial time?
22) reference-request - Problems that are hard to prove in $\mathcal{P}$
23) fl.formal-languages - What notable automaton models have polynomially-decidable containment?
24) cc.complexity-theory - On theoretical aproaches for solving $\mathsf{SAT}$ in special cases
25) cc.complexity-theory - What is an equivalent definition of mP/poly in terms of a Turing machine?
26) cc.complexity-theory - What are some efficient algorithms for determining if a quadratic multivariate polynomial has a solution?
27) reductions - Why is the "general notion of a reduction [...] inherent to the notion of self-reducibility"?
28) polynomial-time - Packing $n$ objects into $m$ bins whose size is variable
29) np-hardness - On integer programming
30) cc.complexity-theory - Complexity of counting integer roots of multivariate polynomials in a polyhedron?
31) cc.complexity-theory - Finding a prime greater than a given bound
32) cc.complexity-theory - Non-Orthogonal Vectors Problem
33) cc.complexity-theory - On complexity of linear programming with quadratic equality/inequality constraints?
34) cc.complexity-theory - What are some efficient algorithms for determining if a system of quadratic multivariate polynomials have a solution?
35) cc.complexity-theory - Time complexity with irrational exponent?
36) polynomial-time - Bounded distance decoding beyond Babai
37) cc.complexity-theory - Is there a generalization of information theory to polynomially knowable information?
38) cc.complexity-theory - A reachability problem
39) polynomial-time - Any result connecting an NP-complete problem with slight super-polynomial time?
40) reference-request - Fitting minimum number of rectangles of width/height 1 into a 2D grid
41) lo.logic - Efficient transformation into CNF preserving entailment