Computer Science Stack Exchange

1 vote

1 answer

64 views

How to find parameter sets for a big-O expression to be fixed-parameter tractable?

complexity-theory runtime-analysis big-o-notation parameterized-complexity

John L.

32.9k

modified 15 hours ago

0 votes

1 answer

99 views

Comments on "Which combinatorial problem is similar to this problem?"

complexity-theory

CommunityBot

1

modified yesterday

5 votes

1 answer

194 views

Weakest reduction for P-completeness

complexity-theory reductions

CommunityBot

1

modified yesterday

2 votes

1 answer

67 views

Exponential Time Hypothesis and the input size vs number of variables

complexity-theory time-complexity satisfiability

Narek Bojikian

4,073

modified 2 days ago

22 votes

1 answer

2k views

Classification of intractable/tractable satisfiability problem variants

complexity-theory reference-request satisfiability

Glorfindel

692

modified 2 days ago

1 vote

2 answers

44 views

Since there is no such thing as infinite memory, can we say that all pushdown automata and Turing machines are actually very big DFA?

complexity-theory turing-machines finite-automata pushdown-automata

Hendrik Jan

27.1k

answered 2 days ago

1 vote

0 answers

19 views

Showing that $ASPACE(f (n)) = DTIME(2^{O(f (n))})$

complexity-theory turing-machines

Yuval Filmus

268k

modified 2 days ago

1 vote

1 answer

43 views

What would $P = NP$ tell us about how the polynomial hierarchy relates to $PSPACE$

complexity-theory

Latif Salum

1

answered May 15 at 11:26

3 votes

2 answers

280 views

Find an upper bound for T(n) = T(n/2) + T(n/2 + 1) using the Substitution Method base case fails

complexity-theory asymptotics runtime-analysis recurrence-relation

John L.

32.9k

modified May 14 at 23:34

1 vote

1 answer

54 views

Time Complexity of Exponentiation Operation as per RAM Model of Computation

complexity-theory time-complexity algorithm-analysis runtime-analysis computation-models

Matt Groff

835

modified May 14 at 1:55

2 votes

1 answer

34 views

Complexity of a restricted SAT problem

complexity-theory time-complexity 3-sat constraint-satisfaction

Yuval Filmus

268k

answered May 13 at 21:19

1 vote

1 answer

157 views

How to prove that one problem belongs to class P?

algorithms complexity-theory time-complexity asymptotics complexity-classes

John L.

32.9k

modified May 13 at 21:02

1 vote

1 answer

33 views

Sum in counting satisfying assignments

algorithms complexity-theory satisfiability counting

Yuval Filmus

268k

answered May 11 at 18:44

0 votes

2 answers

371 views

Time Complexity for brute force algorithm finding cliques of size k in a graph, in terms of n m and k

complexity-theory graphs time-complexity big-o-notation clique

CommunityBot

1

modified May 11 at 18:06

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

How to find parameter sets for a big-O expression to be fixed-parameter tractable?

Comments on "Which combinatorial problem is similar to this problem?"

Weakest reduction for P-completeness

Exponential Time Hypothesis and the input size vs number of variables

Classification of intractable/tractable satisfiability problem variants

Since there is no such thing as infinite memory, can we say that all pushdown automata and Turing machines are actually very big DFA?

Showing that $ASPACE(f (n)) = DTIME(2^{O(f (n))})$

What would $P = NP$ tell us about how the polynomial hierarchy relates to $PSPACE$

Find an upper bound for T(n) = T(n/2) + T(n/2 + 1) using the Substitution Method base case fails

Time Complexity of Exponentiation Operation as per RAM Model of Computation

Complexity of a restricted SAT problem

How to prove that one problem belongs to class P?

Sum in counting satisfying assignments

Time Complexity for brute force algorithm finding cliques of size k in a graph, in terms of n m and k

Hot Network Questions