Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alexander S. Kulikov

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alexander Smal

> Home > Persons > Alexander S. Kulikov

Publications

2018
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/GolovnevKST18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GolovnevKST18
Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Gate elimination: Circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719: 46-63 (2018)
2016
[c20]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/mfcs/GolovnevKST16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/GolovnevKST16
Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. MFCS 2016: 45:1-45:16
[i13]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GolovnevKST16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GolovnevKST16
Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki:
Circuit size lower bounds and #SAT upper bounds through a general framework. Electron. Colloquium Comput. Complex. TR16 (2016)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.