P=NP? Or does P≠ NP which is which [closed] #ComputerScience #PvsNP #Theory
Is NP-completeness known for quadratic selection over 3-element chains with matching interactions? #ComputerScience #NPComplete #Algorithms
Efficient methods for finding origami foldings patterns and paper saving #ComputerScience #Algorithms #Origami
On AI Disclosure Statement Standards in TCS #ComputerScience #AI #Research
lean libs for theoretical computer science #ComputerScience #Theory #Research
Is there an Oracle $A$ with $P^A=NP^A$ and $NP^A\subseteq DTIME(2^{o(n)})$? #ComputerScience #Theory #PvsNP
Can Boolean Nullstellensatz dual witnesses be represented by few Boolean evaluations? #ComputerScience #Theory #Research
Complexity of maintaining H-minor-freeness on edge insertions #ComputerScience #Algorithms #ComplexityTheory
Is this alternating version of set cover NP-Complete? #ComputerScience #Algorithms #NPComplete
Complexity of problems whose solution count has polynomially bounded smoothness #ComputerScience #ComplexityTheory #Algorithms
Coq proof - no verifier can be simultaneously sound and complete on a µ-sensitive claim from an identical classical trace. Check me please! #ComputerScience #FormalMethods #ProofAssistant
PSPACE⊆EXPTime? Or PSPACE⊂EXPTime? #ComputerScience #ComplexityTheory #Research
References for local-distribution lower bounds in n-Queens Completion #ComputerScience #Algorithms #Research
Does this prove a Boolean formula lower bound for NP? #ComputerScience #Theory #NP
Space-efficient compression for binary strings #ComputerScience #Algorithms #DataCompression
Complexity of determining if the edges of a directed graph can be partitioned into edge-disjoint simple cycles of length $>k$ #Algorithms #GraphTheory #ComplexityTheory
Min-difference boolean convolution-like operation #ComputerScience #Algorithms #Math
What exactly is known about the resource-bounded Kolmogorov complexity of witnesses for problems in NP? #ComputerScience #ComplexityTheory #Algorithms
Generalization of the Hamiltonian path problem on Grid Graphs #ComputerScience #Algorithms #GraphTheory
Approximating the utilitarian welfare minus a constant #ComputerScience #Algorithms #Research
Is the Fueter-Polya Conjecture proven #ComputerScience #Theory #Math
Generalization bound for parameters rather than loss functions #ComputerScience #Theory #MachineLearning
Understanding a conference reviewer comment #ComputerScience #Research #Academia
Minimum Degree Spanning Tree Without Restricting Vertices Searched #ComputerScience #Algorithms #GraphTheory
Dynamic transitive closure with immediate new reachability facts #ComputerScience #Algorithms #GraphTheory
What are CS blogs for puzzles/games? #ComputerScience #Puzzles #Games
Relative Two-Function Hypercontractive Inequality $\langle T_{\rho\sigma} f,g \rangle \le \langle T_{\sigma} f,g \rangle^q$ #ComputerScience #Math #Research
Computing parity of a permutation in a streaming-fashion way #ComputerScience #Algorithms #Theory
Do circuits allow to derive EXPSPACE hardness results? #ComputerScience #ComplexityTheory #Research
Is there a complexity theory analogue of Rice's theorem in computability theory? #ComplexityTheory #ComputerScience #Research