Theoretical Computer Science Stack Exchange

Score of 8

1 answer

130 views

On AI Disclosure Statement Standards in TCS

Stefan G.

reputation score 409

answered 4 hours ago

Score of 1

1 answer

144 views

Relative Two-Function Hypercontractive Inequality $\langle T_{\rho\sigma} f,g \rangle \le \langle T_{\sigma} f,g \rangle^q$

CommunityBot

reputation score 1

modified 12 hours ago

Score of 0

0 answers

355 views

Understanding a conference reviewer comment

Julius Burton

reputation score 1

modified 22 hours ago

Score of 3

0 answers

44 views

lean libs for theoretical computer science

Kaveh

reputation score 22263

modified yesterday

Score of -2

0 answers

51 views

Repairing a product-algebra approach to P vs NP — inverses, bijections, and finite counting: Can a cardinality argument ever separate P from NP?

Akram Louiz

reputation score 1

modified yesterday

Score of 2

0 answers

133 views

Is there an Oracle $A$ with $P^A=NP^A$ and $NP^A\subseteq DTIME(2^{o(n)})$?

user77036

reputation score 87

asked 2 days ago

Score of 1

1 answer

486 views

Generalization bound for parameters rather than loss functions

CommunityBot

reputation score 1

modified 2 days ago

Score of 3

1 answer

160 views

Complexity of determining if the edges of a directed graph can be partitioned into edge-disjoint simple cycles of length $>k$

Elian Gomez

reputation score 1

answered Sep 23 at 23:13

Score of 5

1 answer

146 views

Min-difference boolean convolution-like operation

alsips-cl

reputation score 752

modified Sep 20 at 21:12

Score of 1

0 answers

78 views

Can Boolean Nullstellensatz dual witnesses be represented by few Boolean evaluations?

z.10.46

reputation score 11

asked Sep 19 at 23:12

Score of 3

0 answers

134 views

Is this alternating version of set cover NP-Complete?

alsips-cl

reputation score 752

modified Sep 19 at 21:49

Score of 2

1 answer

349 views

Minimum Degree Spanning Tree Without Restricting Vertices Searched

CommunityBot

reputation score 1

modified Sep 19 at 21:08

Score of 2

1 answer

159 views

Complexity of maintaining H-minor-freeness on edge insertions

Laakeri

reputation score 1990

answered Sep 19 at 16:53

Score of 4

1 answer

441 views

Is the Fueter-Polya Conjecture proven

breandan

reputation score 111

answered Sep 15 at 22:09

184 communities for the curious

Explore our questions

On AI Disclosure Statement Standards in TCS

Relative Two-Function Hypercontractive Inequality $\langle T_{\rho\sigma} f,g \rangle \le \langle T_{\sigma} f,g \rangle^q$

Understanding a conference reviewer comment

lean libs for theoretical computer science

Repairing a product-algebra approach to P vs NP — inverses, bijections, and finite counting: Can a cardinality argument ever separate P from NP?

Is there an Oracle $A$ with $P^A=NP^A$ and $NP^A\subseteq DTIME(2^{o(n)})$?

Generalization bound for parameters rather than loss functions

Complexity of determining if the edges of a directed graph can be partitioned into edge-disjoint simple cycles of length $>k$

Min-difference boolean convolution-like operation

Can Boolean Nullstellensatz dual witnesses be represented by few Boolean evaluations?

Is this alternating version of set cover NP-Complete?

Minimum Degree Spanning Tree Without Restricting Vertices Searched

Complexity of maintaining H-minor-freeness on edge insertions

Is the Fueter-Polya Conjecture proven

Hot Network Questions