Results 1  10
of
162
The Complexity of Planar Boolean #CSP with Complex Weights
"... We prove a complexity dichotomy theorem for symmetric complexweighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #Phard over general graphs but tractable over planar graphs are precisely those with a holographic reduction to matchgates. This generali ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We prove a complexity dichotomy theorem for symmetric complexweighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #Phard over general graphs but tractable over planar graphs are precisely those with a holographic reduction to matchgates
A Holant Dichotomy: Is the FKT Algorithm Universal? JinYi Cai
"... We prove a complexity dichotomy for complexweighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specically to answer the question: Is the FKT algorithm under a holographic transformation [38] a universal strategy to obtain polynom ..."
Abstract
 Add to MetaCart
We prove a complexity dichotomy for complexweighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specically to answer the question: Is the FKT algorithm under a holographic transformation [38] a universal strategy to obtain
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems
"... We show that an effective version of Siegel’s Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems, denoted by Holant(f), are defined by a symmetric ternary function ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
function f that is invariant under any permutation of the κ ≥ 3 domain elements. We prove that Holant(f) exhibits a complexity dichotomy. This dichotomy holds even when restricted to planar graphs. A special case of this result is that counting edge κcolorings is #Phard over planar 3regular graphs for κ
Global Optimization Algorithms  Theory and Application
, 2011
"... This ebook is devoted to Global Optimization algorithms, which are methods for finding solutions of high quality for an incredible wide range of problems. We introduce the basic concepts of optimization and discuss features which make optimization problems difficult and thus, should be considered ..."
Abstract

Cited by 94 (26 self)
 Add to MetaCart
This ebook is devoted to Global Optimization algorithms, which are methods for finding solutions of high quality for an incredible wide range of problems. We introduce the basic concepts of optimization and discuss features which make optimization problems difficult and thus, should be considered when trying to solve them. In this book, we focus on
1 νCAx: A Research Agenda for Collaborative ComputerAided Applications
"... A dichotomy exists in the engineering design process between 1) product teams organized to engineer products collaboratively, and 2) the singleuser architectures inherent in computers and computeraided design applications (CAx). Selective design authority is typically assigned to individuals withi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A dichotomy exists in the engineering design process between 1) product teams organized to engineer products collaboratively, and 2) the singleuser architectures inherent in computers and computeraided design applications (CAx). Selective design authority is typically assigned to individuals
Representing Software Systems in MultipleView Development Enivironments
, 1992
"... they create, debug, enhance, and maintain? That is the fundamental question I address in this thesis. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
they create, debug, enhance, and maintain? That is the fundamental question I address in this thesis.
Russian Academy of Sciences Dorodnicyn Computing Centre
"... The process of metal crystallization in casting is considered. To obtain a model of a good quality it is desirable the shape of solidification front to be close to a plane and its law of motion to be close to a preset one. To find a regime of metal solidification that will satisfy the technological ..."
Abstract
 Add to MetaCart
The process of metal crystallization in casting is considered. To obtain a model of a good quality it is desirable the shape of solidification front to be close to a plane and its law of motion to be close to a preset one. To find a regime of metal solidification that will satisfy the technological
Modeling and Analysis of the Collective Dynamics of LargeScale MultiAgent Systems: A Cellular and Network Automata based Approach
, 2006
"... This technical report addresses a particular approach to modeling and analysis of the behavior of largescale multiagent systems. A broad variety of multiagent systems are modeled as appropriate variants of cellular and network automata. Several fundamental properties of the collective dynamics of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This technical report addresses a particular approach to modeling and analysis of the behavior of largescale multiagent systems. A broad variety of multiagent systems are modeled as appropriate variants of cellular and network automata. Several fundamental properties of the collective dynamics of those cellular and network automata are then formally analyzed. Various loosely coupled largescale distributed information systems are of an increasing interest in a variety of areas of computer science and its applications – areas as diverse as team robotics, intelligent transportation systems, open distributed software environments, disaster response management, distributed databases and information retrieval, and computational theories of language evolution. A popular paradigm for abstracting such distributed infrastructures is that of multiagent systems (MAS) made of typically a large number of autonomous agents that locally interact with each other. This report is an attempt at a cellular and network automata based mathematical and computational theory of such MAS. The
Results 1  10
of
162