Sciweavers

2446 search results - page 312 / 490
» Choiceless Polynomial Time
Sort
View
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
13 years 7 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
CORR
2004
Springer
98views Education» more  CORR 2004»
13 years 7 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
ECCC
2000
101views more  ECCC 2000»
13 years 7 months ago
Simplified derandomization of BPP using a hitting set generator
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
Oded Goldreich, Salil P. Vadhan, Avi Wigderson
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 7 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
MOC
2000
97views more  MOC 2000»
13 years 7 months ago
Convergence rates to the discrete travelling wave for relaxation schemes
Abstract. This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating...
Hailiang Liu