Results 1  10
of
11,086
Molecular Computation Of Solutions To Combinatorial Problems
, 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract

Cited by 773 (6 self)
 Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility
Combinatorial Problems
"... regarded as originating in the Ars Combinatoria of Leibniz, has to do with problems of arrangement, operation, and selection within a finite or discrete systemsuch as the aggregate of all possible states of a digital computer. Until recently, preoccupation with continuous mathematics has inhibited ..."
Abstract
 Add to MetaCart
the growth of discrete mathematics. But now it is realized that combinatorial methods can be developed to attack profitably, in modern science and technology, a vast variety of “problems of organized comp1exity””an apt designation of Warren Weaver [l]. In 1947 Hermann Weyl [2] wrote as follows (rearranged s
isomorphic combinatorial problems
, 2006
"... A classification of strategies employed by high school students in isomorphic combinatorial problems ..."
Abstract
 Add to MetaCart
A classification of strategies employed by high school students in isomorphic combinatorial problems
Algebraic structures in combinatorial problems
 TECHNICAL REPORT, TECHNISCHE UNIVERSITAT DRESDEN
, 2001
"... ..."
Logic Programming for Combinatorial Problems
"... Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming. An overview ..."
Abstract
 Add to MetaCart
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming
Combinatorial Problems in OpenAD
"... Abstract. Computing derivatives using automatic differentiation methods entails a variety of combinatorial problems. The OpenAD tool implements automatic differentiation as source transformation of a program that represents a numerical model. We select three combinatorial problems and discuss the so ..."
Abstract
 Add to MetaCart
Abstract. Computing derivatives using automatic differentiation methods entails a variety of combinatorial problems. The OpenAD tool implements automatic differentiation as source transformation of a program that represents a numerical model. We select three combinatorial problems and discuss
On the Complexity of the Bernstein Combinatorial Problem
"... (1 + di), even if all partial degrees di equal 1, a combinatorial problem arises: is it possible to compute in polynomial time the smallest and the greatest coefficients? This article proves that the 3SAT problem, known to be NPcomplete, polynomially reduces to the above defined combinatorial prob ..."
Abstract
 Add to MetaCart
(1 + di), even if all partial degrees di equal 1, a combinatorial problem arises: is it possible to compute in polynomial time the smallest and the greatest coefficients? This article proves that the 3SAT problem, known to be NPcomplete, polynomially reduces to the above defined combinatorial
The Wisdom of the Crowd in Combinatorial Problems
, 2012
"... The "wisdom of the crowd" phenomenon refers to the finding that the aggregate of a set of proposed solutions from a group of individuals performs better than the majority of individual solutions. Most often, wisdom of the crowd effects have been investigated for problems that require singl ..."
Abstract
 Add to MetaCart
single numerical estimates. We investigate whether the effect can also be observed for problems where the answer requires the coordination of multiple pieces of information. We focus on combinatorial problems such as the planar Euclidean traveling salesperson problem, minimum spanning tree problem, and a
Combinatorial Problems in Compiler Optimization
, 2013
"... Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization. The ..."
Abstract
 Add to MetaCart
Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization
Reducibility Among Combinatorial Problems∗
"... A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements of other countable domains. Through simple encodings from such domains into the set of words over a finite ..."
Abstract
 Add to MetaCart
references the recent work, “On the Reducibility of Combinatorial Problems ” [1]. BODY A large class of open problems are mutually convertible via polytime reduc
Results 1  10
of
11,086