Badge
| Editor | First edit. |
This badge has been awarded 1450 times. Recently awarded to: |
1d ago
(post deleted or otherwise unavailable)
— Listing
15117
may 15 at 21:41
(post deleted or otherwise unavailable)
— Adrian
11
may 14 at 8:59
Pushdown automation where number of letter `a` is at least as twice as letter `b` in the word [migrated]
— user2380858
11
may 14 at 4:02
An algorithm to compute the number of paths of length at most k
— Federico Lebrón
1784
may 13 at 23:06
(post deleted or otherwise unavailable)
— Belgi
1214
may 11 at 13:16
(post deleted or otherwise unavailable)
— Fayez Abdlrazaq Deab
62
may 11 at 12:06
Show that Vertex-Cover is NP-complete, using Stable-Set [closed]
— Toralf Westström
13
may 9 at 13:27
(post deleted or otherwise unavailable)
— Tim
12
may 8 at 19:17
Is it possible to simulate a Linear Bounded Automata with logic circuits where links have min-max bounded delays? I need a reference in the literature
— Marco
62
may 7 at 19:07
directed or bidirected in relation to mssp (Multiple source shortest path)
— Adrian De Barro
72
apr 28 at 7:24
Do combinatorial discrepancy upper bounds lead to smaller $epsilon$-nets (as with $epsilon$-samples)?
— Mohamadreza
284
apr 25 at 0:19
(post deleted or otherwise unavailable)
— kba
1012
apr 23 at 8:11
Counting small terms in a determinant calculation over polynomials (counting spanning trees by weight)
— Rasto S.
445
apr 22 at 2:02
(post deleted or otherwise unavailable)
— Rodrigo
1013
apr 21 at 16:45
Avarage classes for PP (probabilistic polynomial time) and PPT machines running in expected polytime
— Grandpa
1034
apr 18 at 6:33
Find the remainder of a large fixed polynomial when divided by a small unknown polynomial
— Erno Lancaster
31
apr 15 at 19:37
(post deleted or otherwise unavailable)
— Michael
11
apr 14 at 7:59
(post deleted or otherwise unavailable)
— cerebrou
11
apr 13 at 18:23
How can you prove that a problem is not solvable in a certain time complexity?
— Tiddo
1255
apr 13 at 6:03
Small graph with gap between chromatic and vector chromatic number?
— Thore Husfeldt
22529
apr 12 at 16:32
In what manner and to which degree would programming on a hypothetical ternary computer differ than from binary computers?
— minopret
1093
apr 12 at 10:52
Verifying consistency of strict and non-strict partial orders constraints
— bitonic
133
apr 11 at 18:01
(post deleted or otherwise unavailable)
— fran.aubry
11
apr 11 at 7:50
(post deleted or otherwise unavailable)
— Eleanore
12
apr 5 at 7:45
(post deleted or otherwise unavailable)
— Four_FUN
11
apr 4 at 10:30
(post deleted or otherwise unavailable)
— Oliver
12
apr 3 at 21:58
(post deleted or otherwise unavailable)
— user15415
12
apr 3 at 10:32
Is there a list of canonical problems in distributed systems?
— marcmagransdeabril
614
apr 2 at 12:36
Follow-the-leader algorithm in swarm formation: literature on the subject?
— David Chouinard
1185
apr 2 at 9:15
Is the gist of English (or any equally familiar natural language) context-free? [closed]
— vermiculus
1031
mar 30 at 12:19
How efficiently can circuits over sets of naturals be transformed to boolean circuits?
— bhitov
12
mar 28 at 14:45
(post deleted or otherwise unavailable)
— Atilla Ozgur
1012
mar 28 at 4:30
(post deleted or otherwise unavailable)
— user62089
1014
mar 27 at 21:39
How efficiently can circuits over sets of naturals be transformed to boolean circuits?
— Jonathan Naysmith
362
mar 27 at 17:44
(post deleted or otherwise unavailable)
— Chill
12