#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2001

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Serguei Norine, William T. Trotter, +11 authors Kenneth Diemunsch
- 2005

- Patrick Cégielski, Denis Richard, Maxim Vsemirnov
- Fundam. Inform.
- 2007

- M. Vsemirnov, Sidney Sussex

We find a new Fibonacci-like sequence of composite numbers and reduce the current record for the starting values to A 0 = 106276436867 and A 1 = 35256392432.

- Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov
- Electronic Colloquium on Computational Complexity
- 2001

We survey recent algorithms for the propositional satisfiability problem. In particular, we consider algorithms having the best current worst-case upper bounds on their complexity. We also discuss some related issues: a derandomization of the algorithm of Paturi, Pudlák, Saks, and Zane, the Valiant–Vazirani lemma, and random walk algorithms with the " back… (More)

- A Vershik, M Vsemirnov
- 2008

The local stationary presentation of the alternating groups and the normal form. ABSTRACT We give the canonical normal form for the elements of the finite or infinite alternating groups using local stationary presentation of these groups.

- C. Franchi, Maxim Vsemirnov
- Eur. J. Comb.
- 2003

- Maxim Vsemirnov
- SIAM J. Discrete Math.
- 2004

- Oleg Eterevsky, Maxim Vsemirnov, Sidney Sussex
- 2001

- Maxim Vsemirnov
- Ann. Pure Appl. Logic
- 2001

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N, +, n → p n), where p n denotes the (n + 1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some extra function. In this direction we show the undecidability of the existential part of the theory Th(N, +, n → p n , n → r… (More)

- ‹
- 1
- ›