6:59 PM
a recent kinda weird problem but it ref's to DAGs & has some great/rare empirical teamwork on the site...
12
Some time ago, I posted a reference request for graph problems where we want to find a 2-partition of the edges where both sets fulfill a property not related to their cardinality. I was trying to prove that the following problem is NP-hard: Given a tournament $G = (V,E)$, is there a feedback...
the question captures the great back-and-forth/interplay of math/science research that normally happens in papers, but on a more micro level of posts/comments.
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models, and answer set solvers — programs for generating stable models—are used to perform search. The computational process employed in the design of many answer set solvers is an enhancement of the DPLL algorithm and, in principle, it always terminates (unlike Prolog query evaluation, which may lead to an infinite loop).
In...
« first day (215 days earlier) ← previous day next day → last day (3414 days later) »
Transcript for
Jan27
Jan '1430
Jan31
theory salon
theoretical computer science. highlight reel vzn1.wordpress.co...