default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArist Kojevnikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j4]Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov
, Grigory Yaroslavtsev:
New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett. 110(7): 264-267 (2010)- [c8]Arist Kojevnikov, Alexander S. Kulikov:
Circuit Complexity and Multiplicative Complexity of Boolean Functions. CiE 2010: 239-245
2000 – 2009
- 2009
- [j3]Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. J. Satisf. Boolean Model. Comput. 6(1-3): 53-69 (2009) - [c7]Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev:
Finding Efficient Circuits Using SAT-Solvers. SAT 2009: 32-44 - 2008
- [c6]Arist Kojevnikov, Sergey I. Nikolenko:
New Combinatorial Complete One-Way Functions. STACS 2008: 457-466 - [i3]Arist Kojevnikov, Sergey I. Nikolenko:
New Combinatorial Complete One-Way Functions. CoRR abs/0802.2863 (2008) - 2007
- [c5]Arist Kojevnikov:
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. SAT 2007: 70-79 - [i2]Arist Kojevnikov:
Improved Lower Bounds for Resolution over Linear Inequalities. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Edward A. Hirsch, Arist Kojevnikov:
Several notes on the power of Gomory-Chvátal cuts. Ann. Pure Appl. Log. 141(3): 429-436 (2006) - [c4]Arist Kojevnikov, Dmitry Itsykson:
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ICALP (1) 2006: 323-334 - [c3]Arist Kojevnikov, Alexander S. Kulikov:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. SAT 2006: 11-21 - [c2]Arist Kojevnikov, Alexander S. Kulikov:
A new approach to proving upper bounds for MAX-2-SAT. SODA 2006: 11-17 - 2005
- [j1]Edward A. Hirsch, Arist Kojevnikov:
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. Ann. Math. Artif. Intell. 43(1): 91-111 (2005) - 2003
- [i1]Edward A. Hirsch, Arist Kojevnikov:
Several notes on the power of Gomory-Chvatal cuts. Electron. Colloquium Comput. Complex. TR03 (2003) - 2001
- [c1]Edward A. Hirsch, Arist Kojevnikov:
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. CP 2001: 605-609
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
