![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 64 matches
- 2024
- Alexander Barvinok:
On the zeros of partition functions with multi-spin interactions. CoRR abs/2406.04179 (2024) - 2023
- Alexander I. Barvinok:
Smoothed counting of 0-1 points in polyhedra. Random Struct. Algorithms 63(1): 27-60 (2023) - 2022
- Alexander I. Barvinok:
Computing theta function. CoRR abs/2208.05405 (2022) - 2021
- Alexander I. Barvinok:
Smoothed counting of 0-1 points in polyhedra. CoRR abs/2103.05488 (2021) - Alexander I. Barvinok:
When the positive semidefinite relaxation guarantees a solution to a system of real quadratic equations. CoRR abs/2106.08119 (2021) - Alexander I. Barvinok, Mark Rudelson:
A quick estimate for the volume of a polyhedron. CoRR abs/2112.06322 (2021) - 2020
- Alexander I. Barvinok:
Stability and complexity of mixed discriminants. Math. Comput. 89(322): 717-735 (2020) - Alexander I. Barvinok, Anthony Della Pella:
Testing for Dense Subsets in a Graph via the Partition Function. SIAM J. Discret. Math. 34(1): 308-327 (2020) - Alexander I. Barvinok:
Integrating products of quadratic forms. CoRR abs/2002.07249 (2020) - Alexander I. Barvinok, Nicholas Barvinok:
More on zeros and approximation of the Ising partition function. CoRR abs/2005.11232 (2020) - Alexander I. Barvinok:
Testing systems of real quadratic equations for approximate solutions. CoRR abs/2006.09221 (2020) - 2019
- Alexander I. Barvinok, Guus Regts:
Weighted counting of solutions to sparse systems of equations. Comb. Probab. Comput. 28(5): 696-719 (2019) - 2018
- Alexander I. Barvinok:
Computing permanents of complex diagonally dominant matrices and tensors. CoRR abs/1801.04191 (2018) - Alexander I. Barvinok:
Stability and complexity of mixed discriminants. CoRR abs/1806.05105 (2018) - Alexander I. Barvinok:
Approximating real-rooted and stable polynomials, with combinatorial applications. CoRR abs/1806.07404 (2018) - Alexander I. Barvinok, Anthony Della Pella:
Searching for dense subsets in a graph via the partition function. CoRR abs/1807.02054 (2018) - 2017
- Alexander I. Barvinok, Pablo Soberón
:
Computing the partition function for graph homomorphisms. Comb. 37(4): 633-650 (2017) - Alexander I. Barvinok:
Weighted counting of non-negative integer points in a subspace. CoRR abs/1706.05423 (2017) - 2016
- Alexander I. Barvinok:
Combinatorics and Complexity of Partition Functions. Algorithms and combinatorics 30, Springer 2016, ISBN 978-3-319-51828-2, pp. 1-303 - Alexander I. Barvinok:
Computing the Permanent of (Some) Complex Matrices. Found. Comput. Math. 16(2): 329-342 (2016) - Alexander I. Barvinok, Pablo Soberón
:
Computing the partition function for graph homomorphisms with multiplicities. J. Comb. Theory A 137: 1-26 (2016) - Alexander I. Barvinok:
Approximating permanents and hafnians of positive matrices. CoRR abs/1601.07518 (2016) - 2015
- Alexander I. Barvinok:
On testing Hamiltonicity of graphs. Discret. Math. 338(1): 53-58 (2015) - Alexander I. Barvinok:
Computing the Partition Function for Cliques in a Graph. Theory Comput. 11: 339-355 (2015) - Alexander I. Barvinok:
Computing the partition function of a polynomial on the Boolean cube. CoRR abs/1503.07463 (2015) - 2014
- Alexander I. Barvinok:
Computing the permanent of (some) complex matrices. CoRR abs/1405.1303 (2014) - 2013
- Alexander I. Barvinok:
A bound for the number of vertices of a polytope with applications. Comb. 33(1): 1-10 (2013) - Alexander I. Barvinok, Seung Jin Lee, Isabella Novik:
Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets. Discret. Comput. Geom. 49(3): 429-443 (2013) - Alexander I. Barvinok, J. A. Hartigan:
The number of graphs and a random graph with a given degree sequence. Random Struct. Algorithms 42(3): 301-348 (2013) - 2011
- Alexander I. Barvinok, Alex Samorodnitsky:
Computing the Partition Function for Perfect Matchings in a Hypergraph. Comb. Probab. Comput. 20(6): 815-835 (2011)
skipping 34 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 08:47 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint