Sciweavers

933 search results - page 31 / 187
» Monotone Complexity of a Pair
Sort
View
NETWORKS
2010
13 years 6 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
FSTTCS
2009
Springer
14 years 2 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
HYBRID
2005
Springer
14 years 1 months ago
Existence of Cascade Discrete-Continuous State Estimators for Systems on a Partial Order
In this paper, a cascade discrete-continuous state estimator on a partial order is proposed and its existence investigated. The continuous state estimation error is bounded by a mo...
Domitilla Del Vecchio, Richard M. Murray
RANDOM
2001
Springer
13 years 12 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
AAAI
2004
13 years 9 months ago
Logic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Victor W. Marek, Miroslaw Truszczynski