- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs ; day:11 ; month:8 ; year:2022 ; pages:1-28
Algorithmica ; (11.8.2022), 1-28
- Creator
-
Jonsson, Peter
Lagerkvist, Victor
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-01017-8
- URN
-
urn:nbn:de:101:1-2022102821261618246097
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
27.04.2024, 10:04 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Jonsson, Peter
- Lagerkvist, Victor
- SpringerLink (Online service)
Other Objects (12)
Lower Bounds for Heuristic Algorithms
DLP in semigroups: Algorithms and lower bounds
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
Pareto Sums of Pareto Sets : Lower Bounds and Algorithms
New algorithms and lower bounds for sequential access data compression
Solving infinite games with bounds
Solving infinite games with bounds
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Proportionality’s Lower Bound
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Algorithms to estimate the lower bounds of recombination with or without recurrent mutations
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower Bounds for Heuristic Algorithms
DLP in semigroups: Algorithms and lower bounds
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
Pareto Sums of Pareto Sets : Lower Bounds and Algorithms
New algorithms and lower bounds for sequential access data compression
Solving infinite games with bounds
Solving infinite games with bounds
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Proportionality’s Lower Bound
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Algorithms to estimate the lower bounds of recombination with or without recurrent mutations
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Lower Bounds for Heuristic Algorithms
DLP in semigroups: Algorithms and lower bounds
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
Pareto Sums of Pareto Sets : Lower Bounds and Algorithms
New algorithms and lower bounds for sequential access data compression
Solving infinite games with bounds
Solving infinite games with bounds
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Proportionality’s Lower Bound
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Algorithms to estimate the lower bounds of recombination with or without recurrent mutations