Theoretical Computer Science

Help Center > Badges > Scholar

 Scholar
Ask a question and accept an answer.
Awarded 2266 times.
Embarrassingly Parallel: Formal Definition & Citation
Awarded 21 hours ago
Bounded distance decoding beyond Babai
Awarded Jan 21 at 0:25
Known property? Maximum radius of connected induced subgraph
Awarded Jan 20 at 15:45
Minimum vertex cover and odd cycles
Awarded Jan 15 at 11:50
Convex polygons inclusion relation
Awarded Jan 15 at 8:35
How to choose good diagonals when partitioning an orthogonal polygon into rectangles?
Awarded Jan 13 at 9:50
Hardness of finding if a vertex lies on a simple directed path between two vertices
Awarded Jan 9 at 17:10
Data structures for embedded simplicial complexes
Awarded Jan 6 at 18:05
Is there a standard format for Dependent QBF?
Awarded Jan 1 at 18:00
Turing meta-oracle
Awarded Dec 29 '19 at 18:30
finding maximum weight subgraph
Awarded Dec 26 '19 at 13:05
Reducing 3-XOR-SAT to HORN-SAT
Awarded Dec 23 '19 at 11:45
What is the role of “universe” types in intuitionistic type theory?
Awarded Dec 14 '19 at 23:15
$NP$-Completeness of $\epsilon$-balanced graph partitioning for fixed $\epsilon$
Awarded Dec 14 '19 at 9:25
What is the complexity of checking equivalence of two boolean formulae without NOT symbol?
Awarded Dec 14 '19 at 0:15
Fast algorithm to find pair of triangles with a common edge in a complete graph
Awarded Dec 13 '19 at 20:05
Complexity of finding an edge set yielding specified vertex degrees
Awarded Dec 12 '19 at 23:50
What are the criteria for inviting conference papers (e.g. SODA) for special issue?
Awarded Dec 12 '19 at 0:50
Small kernel (i.e. proof-verifier) for Agda?
Awarded Dec 5 '19 at 10:05
Maximum matching M with the condition G[M] is 2K_2-free
Awarded Nov 30 '19 at 10:00
Term for a set that is not immune
Awarded Nov 25 '19 at 1:40
Where does a C-like language without heaps belong in the automata hierarchy?
Awarded Nov 20 '19 at 7:05
If $P=BPP$, then Is it correct that $IP=NP$?
Awarded Nov 19 '19 at 18:20
Global satisfiability in LTL
Awarded Nov 19 '19 at 12:40
Has this generalization of the vertex cover problem been researched?
Awarded Nov 18 '19 at 17:00
State of research on SHA-1 Collision Attacks
Awarded Nov 14 '19 at 15:15
Which complexity class does this problem belong to?
Awarded Nov 10 '19 at 10:55
Why NL is not L
Awarded Nov 9 '19 at 1:05
Example of decidable NP-hard problem that is not NP-complete [closed]
Awarded Nov 8 '19 at 23:55
Is the isomorphism problem between posets represented by DAGs GI-complete?
Awarded Nov 7 '19 at 1:00
Are there common names for the subtiers of PTIME?
Awarded Nov 2 '19 at 0:50
How to efficiently read the theoretical computer science research papers?
Awarded Oct 31 '19 at 6:00
What languages can be reduced to a NP-complete problem in polynomial time
Awarded Oct 29 '19 at 9:00
Maximization of Mutual Information
Awarded Oct 27 '19 at 16:10
Computing the edge orbits of a graph (and discussing definitions)
Awarded Oct 25 '19 at 9:00
Is the Chi-square divergence a Bregman divergence?
Awarded Oct 15 '19 at 13:45
Re-packing of integers into fixed-size bins
Awarded Oct 13 '19 at 21:10
How tight is the XOR lemma?
Awarded Oct 11 '19 at 23:45
Complexity of SAT parameterized by treewidth
Awarded Oct 9 '19 at 22:20
What class of languages is recognized by finite-state automata with $k$ heads?
Awarded Oct 8 '19 at 0:05
What's the point of stack judgement in CBPV?
Awarded Oct 7 '19 at 20:15
Obtaining the Axiom of Choice through a modality in HTT
Awarded Sep 29 '19 at 2:30
Can we have more than one Deterministic Finite Automata diagrams for a set of strings? [closed]
Awarded Sep 25 '19 at 16:55
Efficient randomness reduction using k-wise independence
Awarded Sep 25 '19 at 3:20
Optimalization of sum $f(x_i, x_j)$ for all $i < j$ pairs through permutation only?
Awarded Sep 24 '19 at 9:25
Dividing a complete graph into two cliques with maximal sum of edge weights
Awarded Sep 23 '19 at 22:55
Reconstruction of a sequence generated by a Markov chain - reference request
Awarded Sep 20 '19 at 7:45
Satisfiability problems with restricted (not bounded) number of occurrences per variable
Awarded Sep 11 '19 at 14:35
Why is differential privacy defined over the exponential function?
Awarded Sep 10 '19 at 1:05
About a pre-processing step for primal–dual weighted set cover problem
Awarded Sep 5 '19 at 1:25
What is a natural problem in theory of computation?
Awarded Aug 29 '19 at 3:10
Does $\exists\mathbb{R}=\mathbf{PSPACE}$?
Awarded Aug 28 '19 at 19:35
3-coloring planar graphs in $O\left(3^{n^.5}\right)$?
Awarded Aug 20 '19 at 21:45
Hospital Resident Matching Algorithm with Incomplete Preferences
Awarded Aug 18 '19 at 22:30
Hardness of LWE on not-uniform vector samples
Awarded Aug 18 '19 at 12:00
Are there digraphs such that any two arborescences are arc-disjoint?
Awarded Aug 9 '19 at 4:50
The asymptotic behavior of a recurrence related to stable matchings
Awarded Aug 8 '19 at 17:25
DPDA with parameterized states
Awarded Aug 3 '19 at 17:00
What is the formal definition of a stacked based finite state machine?
Awarded Jul 22 '19 at 12:30
Efficient graph isomorphism for similar graph queries
Awarded Jul 18 '19 at 0:55
1 2 3 4 5 … 38