◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

O. Zaikin

10 papers hereh-index 14727 citations134 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • middle author6
  • last author3

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • cs.AI4
  • cs.DC2
  • cs.CR1
  • cs.LO1
  • math.CO1
  • physics.soc-ph1

identity via Semantic Scholar / OpenAlex

activity
20112022
most citedEncoding Cryptographic Functions to SAT Using Transalg System

21 citations · 67 across the 10 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.AI2015★ 10 cited

Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem

Alexander Semenov, Oleg Zaikin

In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corres…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.