Sciweavers

664 search results - page 62 / 133
» Some results for a class of generalized polynomials
Sort
View
CSR
2008
Springer
14 years 10 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
FOCS
2006
IEEE
15 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
FOGA
2007
14 years 11 months ago
Inbreeding Properties of Geometric Crossover and Non-geometric Recombinations
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined using the distance associated to the search space in ...
Alberto Moraglio, Riccardo Poli
AAAI
2011
13 years 9 months ago
Qualitative Numeric Planning
We consider a new class of planning problems involving a set of non-negative real variables, and a set of non-deterministic actions that increase or decrease the values of these v...
Siddharth Srivastava, Shlomo Zilberstein, Neil Imm...