#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2001

2008

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

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

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

The propositional satisfiability problem (SAT) is one of the most naturalNP-complete problems, and therefore its complexity is crucial for the computational complexity theory. Since SAT is NP-complete, it is unlikely that SAT can be solved in polynomial time. However, it is still important to understand how much time is required to solve SAT, even if this… (More)

- A Vershik, M Vsemirnov
- 2008

We give the canonical normal form for the elements of the finite or infinite alternating groups using local stationary presentation of these groups. 1 The problem. The set of finite or infinite generators x1, . . . xn (n ∈ N or infinite) of a group G is called the set of local generators of the depth k if the following relations take place: xi · xj = xj ·… (More)

- M. Vsemirnov, Sidney Sussex

We find a new Fibonacci-like sequence of composite numbers and reduce the current record for the starting values to A0 = 106276436867 and A1 = 35256392432. In this note we consider Fibonacci-like sequences, i.e., the sequences {An} satisfying the recurrence relation An = An−1 + An−2, n ≥ 2. (1) Ronald Graham [1] proved that there exist relatively prime… (More)

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

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n 7→ pn), where pn 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 7→ pn, n 7→ rn),… (More)

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

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

- Oleg Eterevsky, Maxim Vsemirnov, Sidney Sussex
- 2001

The classical Carmichael numbers are well known in number theory. These numbers were introduced independently by Korselt in [8] and Carmichael in [2] and since then they have been the subject of intensive study. The reader may find extensive but not exhaustive lists of references in [5, Sect. A13], [11, Ch. 2, Sec. IX]. Recall that a positive composite… (More)