611 search results - page 2 / 123 » Yuri, Logic, and Computer Science |
RTA
1998
Springer
13 years 9 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
Presentation
A nice presentation by Yuri Boykov, Daniel Cremers, Vladimir Kolmogorov, at the European Conference on Computer Vision (ECCV) 2006, that finds the relation between Graph Cuts and L...
ICS
2007
Tsinghua U.
13 years 11 months ago
2007
Tsinghua U.
EATCS
2000
13 years 5 months ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.