Sciweavers

CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 6 months ago
A Formalization of Polytime Functions
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
Sylvain Heraud, David Nowak
MST
1998
76views more  MST 1998»
13 years 11 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 12 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
FSS
2007
79views more  FSS 2007»
13 years 12 months ago
On the characterizations of (S, N)-implications
The characterization of S-implications generated from strong negations presented firstly by Trillas and Valverde in 1985 is wellknown in the literature. In this paper we show tha...
Michal Baczynski, Balasubramaniam Jayaram
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 12 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
DLT
2006
14 years 1 months ago
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
Manfred Kufleitner
ICLP
1999
Springer
14 years 4 months ago
Bounded Nondeterminism of Logic Programs
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Dino Pedreschi, Salvatore Ruggieri
PODC
1999
ACM
14 years 4 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
14 years 4 months ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna