This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
14092.7 The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999)(Correct)
this paper we try to give a survey of results concerning algorithms, complexity, and applications of this problem, and also provide an updated bibliography. Of course, we build upon precursory works w... / . Computational Complexity Bounds and br interpretation. Computational Complexity The maximum clique
11829.4 An Overview of Nonmonotonic Reasoning and Logic Programming - Minker (1993)(Correct)
The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I discuss the pre-history of nonmonotonic reasoning starting from approximately 1958. I then review the research t... / logic programming and computational complexity. It is of interest to br logic programming and computational complexity are unique contributions
11579.3 Higher Order Logic - Leivant (1994)(Correct)
Contents
1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2
2 The expressive power of second order Logic : : : : : : : : : : : 3
2.1 The language of second order logic : : : : :... / . Higher order logic and computational complexity br characterizations of computational complexity classes. Given the
10372.6 Deterministic Job-Shop Scheduling: Past, Present and Future - Jain, Meeran (1998)(Correct)
Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been inves... / we digress to explore the computational complexity. If x is the size of br Kan A. H. G. Computational complexity of discrete optimization
9883.2 Lecture Notes on Cryptography - Goldwasser, Bellare (1996)(Correct)
Contents
1 Introduction to Modern Cryptography 12
1.1 Encryption: Historical Glance : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12
1.2 Modern Encryption: A Computational C... / . Modern Encryption A Computational Complexity Based Theory br . Modern Encryption A Computational Complexity Based Theory Modern
9231.8 Autoepistemic Logic As A Unified Basis For Nonmonotonic Reasoning - Niemelä (1993)(Correct)
Autoepistemic logic is investigated in a general setting where autoepistemic reasoning based on a given classical logic is studied. The possible sets of autoepistemic conclusions from a set of premise... / autoepistemic logic computational complexity automated theorem br when studying the computational complexity of McDermott and Doyle's
8981.5 A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993)(Correct)
This paper surveys the main results appeared in the literature on the computational
complexity of non-monotonic inference tasks. We not only give results
about the tractability/intractability of the i... / in the literature on the computational complexity of non-monotonic
8176.4 Temporal Query Languages: a Survey - Chomicki (1995)(Correct)
We define formal notions of temporal domain and temporal database, and use them
to survey a wide spectrum of temporal query languages. We distinguish between an
abstract temporal database and its conc... / query processing and its computational complexity and br negative influence on the computational complexity of query processing. We
7756.1 Exploiting Structure for Planning and Control - Lin (1997)(Correct)
of " Exploiting Structure for Planning and Control "
by Shieu-Hong Lin, Ph.D., Brown University, May 1997.
Thesis advisor Thomas L. Dean.
Discrete dynamical systems in the form of finite automata or M... / . . Computational Complexity br . . Computational Complexity
7706.0 Image Processing with Multiscale Stochastic Models - Luettgen (1993)(Correct)
In this thesis, we develop image processing algorithms and applications for a particular
class of multiscale stochastic models. First, we provide background on the model
class, including a discussion ... / B. MR Algorithm Computational Complexity Analysis br in fact has a per pixel computational complexity which is independent of
6680.5 Learning in Order to Reason - Roth (1995)(Correct)
Any theory aimed at understanding commonsense reasoning, the process that humans
use to cope with the mundane but complex aspects of the world in evaluating everyday
situations, should account for its... / Reasoning . The Computational Complexity of Counting Problems br we adopt the theory of computational complexity as our methodology for
6130.7 Global Optimization Approaches in Protein Folding and Peptide Docking - Floudas, Klepeis, Pardalos (1998)(Correct)
The recent advances in genetic engineering, high powered computing
and global optimization continue to stimulate interest in the area of
molecular modeling and protein structure prediction. The goal... / However because of the computational complexity associated with these br functions. Due to the computational complexity of rigorous energy
6037.8 Fast Object Recognition by Selectively Examining Hypotheses - Olson (1994)(Correct)
Fast Object Recognition by Selectively Examining Hypotheses
by
Clark Francis Olson
Doctor of Philosophy in Computer Science
University of California at Berkeley
Professor Jitendra Malik, Chair
Several... / allows us to reduce the computational complexity of the algorithm as well br . . Computational complexity .
6004.1 Probabilistic Analysis of Learning in Artificial Neural Networks: The .. - Anthony (1997)(Correct)
There are a number of mathematical approaches to the study of learning and generalization in
artificial neural networks. Here we survey the `probably approximately correct' (PAC) model
of learning and... / be used for training. Computational complexity considerations are br . Computational Complexity of Learning
5887.1 Artificial Intelligence: A Computational Perspective - Nebel (1994)(Correct)
Although the computational perspective on cognitive tasks has always
played a major role in Artificial Intelligence, the interest in the precise
determination of the computational costs that are requi... / describe what insights a computational complexity analysis can provide and br worthless to analyze the computational complexity of these problems. In
5837.8 Algebraic Methods for Deterministic Blind Beamforming - van der Veen (1998)(Correct)
Deterministic blind beamforming algorithms try to separate
superpositions of source signals impinging on a phased antenna array by
using deterministic properties of the signals or the channels such as... / generally have a lower computational complexity and can track a br is a somewhat reduced computational complexity. D. Source
5614.7 Data Mining: An Overview from a Database Perspective - Chen, Han, Yu (1996)(Correct)
Mining information and knowledge from large databases has been recognized by many researchers as a key research topic in database systems and machine learning, and by many industrial companies as an i... / of data and the computational complexity of some data mining br both PAM and CLARA. The computational complexity of every iteration in
5543.2 Computational Complexity Of Neural Networks: A Survey - Orponen (1995)(Correct)
We survey some of the central results in the complexity theory of discrete neural
networks, with pointers to the literature. Our main emphasis is on the computational
power of various acyclic and c... / Of Computing to Appear Computational Complexity Of Neural Networks A br words Neural networks computational complexity threshold circuits
5466.8 GLR*: A Robust Grammar-Focused Parser for Spontaneously Spoken.. - Lavie (1996)(Correct)
The analysis of spoken language is widely considered to be a more challenging task than the
analysis of written text. All of the difficulties of written language can generally be found in
spoken langu... / . Computational Complexity and Performance of the br algorithm analyzes its computational complexity and evaluates its
5386.4 Complexity Issues in Coding Theory - Barg (1997)(Correct)
This paper gives concatenated
codes with uniform construction complexity of order n unknown
it is possible to notably improve the guaranteed error correction of the codes.
The major steps that accoun... / use of coding theory in computational complexity in R. Calderbank Ed. br Electronic Colloquium on Computational Complexity TR -
5312.6 Computational Topology - Dey, Edelsbrunner, Guha (1999)(Correct)
The authors of this article believe there is or should be
a research area appropriately referred to as computational
topology. Its agenda includes the identification
and formalization of topological q... / we can study its computational complexity. It is important to br of studying the computational complexity or else we are likely
5221.4 On models, criteria and search strategies for motion estimation in.. - Stiller, Konrad (1998)(Correct)
Motion estimation is one of the key techniques helping solve problems encountered
in image sequence compression and processing, and in computer vision. Redundancy
elimination in digital video and trac... / and or reduce the computational complexity of the algorithm. In the br be applied to reduce the computational complexity. These strategies aim at
5152.3 Efficient simulation of action potential propagation in a bidomain - Hooke (1992)(Correct)
Computer simulation is an important tool for investigating the propagation behaviour of
electrical excitation in cardiac tissue. When ionic models of cell membrane excitation are
combined with the bid... / needed. One aspect of the computational complexity of this problem is the br substantially increase the computational complexity of a numerical solution
5062.7 The Quantitative Structure of Exponential Time - Lutz (1993)(Correct)
Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E and EXP are surveyed. The measure structure of these classes is seen to interact in informative... / properties of interest in computational complexity. Such interactions br have uniform criteria for computational complexity we consider all such
4932.5 Multiresolution Techniques In Image Processing - Rao (1995)(Correct)
Multiresolution, an effective paradigm for signal processing, offers a natural, hierarchical view of information. As a computational tool, multiresolution can be applied to a variety of problems in si... / to reduce the computational complexity of image processing br of the image. Thus the computational complexity of processing the
4836.0 Complexity Issues in Discrete Hopfield Networks - Floréen, Orponen(Correct)
We survey some aspects of the computational complexity theory of discrete-time and
discrete-state Hopfield networks. The emphasis is on topics that are not adequately
covered by the existing survey li... / survey some aspects of the computational complexity theory of discrete-time br general introductions to computational complexity issues in neural
4823.8 Combinatorial Optimization: A Survey - Grötschel, Lovász (1993)(Correct)
This paper is a chapter of the forthcoming Handbook of Combinatorics, to be published by North-Holland. It surveys the basic techniques and methods in combinatorial optimization. We organize our mater... / model of parallel computational complexity. Another important
4753.2 Computing Near-Optimal Solutions to Combinatorial Optimization.. - Shmoys (1995)(Correct)
In the past few years, there has been significant progress in our
understanding of the extent to which near-optimal solutions can be efficiently
computed for NP-hard combinatorial optimization probl... / threads of research in computational complexity theory has been to give br interactive protocols. Computational complexity - . . M.
4735.5 Coevolutionary Search Among Adversaries - Rosin (1997)(Correct)
xii
I Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1
A. Adversarial Problems : : : : : : : :... / E. Computational Complexity br Section II.E explores the computational complexity of game learning.
4702.7 Finding Hard Instances of the Satisfiability Problem: A Survey - Cook, Mitchell (1997)(Correct)
Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we conside... / position in the study of computational complexity. As the dual of br H. Papadimitriou. Computational Complexity. Addison-Wesley .
4653.7 Nonparametric Regression for Learning - Schaal (1994)(Correct)
In recent years, learning theory has been increasingly
influenced by the fact that many learning algorithms
have at least in part a comprehensive interpretation in terms of
well established statisti... / formed i.e.what is the computational complexity of a lookup
4552.4 Tractable Reasoning via Approximation - Schaerf, Cadoli (1995)(Correct)
Problems in logic are well-known to be hard to solve in the worst case. Two
different strategies for dealing with this aspect are known from the literature:
language restriction and theory approximati... / to perform have high computational complexity. Problems in logic are br AI typically have higher computational complexity than classical -
4415.8 Terminological Constraint Network Reasoning and its Application to.. - Weida (1993)(Correct)
Terminological systems in the tradition of KL-ONE are widely used in AI to represent
and reason with concept descriptions. They compute subsumption relations between
concepts and automatically classif... / . . Computational Complexity br . . Computational Complexity of Subsumption
4369.9 A Survey of Methods for Scaling Up Inductive Learning Algorithms - Provost, Kolluri (1997)(Correct)
Each year, one of the explicit challenges for the KDD research community is to develop
methods that facilitate the use of inductive learning algorithms for mining very large databases.
By collecting... / memory. No matter what the computational complexity of the algorithm if br analysis predicts a computational complexity of O e log
4343.5 Robust Iterative Methods On Unstructured Meshes - Marian Brezina (1997)(Correct)
We propose and analyze three multilevel iterative solvers of both domain decomposition
and multigrid type. All of these methods are algebraic, allowing
almost or fully black-box implementation. Their ... / are superior in terms of computational complexity and storage requirements. br the asymptotic computational complexity of these methods for
4332.0 Preconditioning and Parallel Preconditioning - Duff, van der Vorst (1998)(Correct)
We review current methods for preconditioning systems of equations for their
solution using iterative methods. We consider the solution of unsymmetric as
well as symmetric systems and discuss techniqu... / preconditioner adds to the computational complexity of an iterative method br they tend to increase the computational complexity by requiring more
4315.4 Esprit Bra Iii Project Nat 7130 - Number March(Correct)
Contents
Editor's message 1
Objectives of the research carried out in
NAT 1
Results of the research carried out in NAT 4
Conclusions 13
List of Publications 16
Anonynous ftp sites 28
NAT Consortium 2... / with respect to their computational complexity. Mathematical br and analysis having low computational complexity. The development of more
4261.6 Algorithms and Complexity for Temporal and Spatial Formalisms -.. - Drakengren (1997)(Correct)
This paper combines two directions in temporal reasoning: the search for
tractable subalgebras of Allen's algebra, and providing temporal formalisms
with the possibility of expressing not only qualita... / thesis is the study of computational complexity of temporal and spatial br and some theory of computational complexity. An good introduction
4254.4 Selected Topics in Computational Biology - DasGupta, Wang (1998)(Correct)
Introduction
The modern era of molecular biology began with the discovery of the double
helical structure of DNA. Today, sequencing nucleic acids, the determination
of genetic information at the most... / of algorithms and computational complexity such as NP P and br the computational complexity of computing it has
4141.5 Temporal Deductive Databases - Baudinet, Chomicki, Wolper (1992)(Correct)
We survey a number of approaches to the problem of finite representation of infinite temporal extensions.
Two of them, Datalog 1S and Templog, are syntactical extensions of Datalog ; the third is base... / expressiveness computational complexity. CR Classification br expressiveness and the computational complexity of these languages. We
4093.8 Selectivity: Reductions, Nondeterminism, and Function Classes - Hemaspaandra, Hoene, Naik, Ogiwara.. (1993)(Correct)
A set is P-selective [Sel79] if there is a polynomial-time semi-decision algorithm for the
set---an algorithm that given any two strings decides which is "more likely" to be in the
set. This paper stu... / level. Keywords computational complexity complexity classes br and O. Watanabe. On the computational complexity of small descriptions.
4084.6 Therapy Plan Generation in Complex Dynamic Environments - Arnold, Jantke (1994)(Correct)
There has been developed a methodology for the automatic synthesis of therapy plans
for complex dynamic systems. An algorithm has been implemented and testet. This is
the core of some control synthesi... / concepts are adopted from computational complexity investigations and
4055.3 An Agent-Based Approach to the Design of Rapidly Deployable Fault.. - Paredis (1996)(Correct)
There exists a need for manipulators that are more flexible and reliable than the current fixed
configuration manipulators. Indeed, robot manipulators can be easily reprogrammed to perform
different t... / . . Computational Complexity br . . Computational Complexity Let be the number of
4031.2 Real-Time Optical Flow Extended in Time - Camus, Bülthoff (1995)(Correct)
Currently two major limitations to applying vision in real tasks are robustness in realworld,
uncontrolled environments, and the computational resources required for real-time
operation. In particular... / infeasible due to their computational complexity. This paper describes a
4030.1 Models of Computation for Embedded System Design - Lavagno, Sangiovanni-Vincentelli.. (1998)(Correct)
In the near future, most objects of common use will contain electronics
to augment their functionality, performance, and safety. Hence, time-tomarket,
safety, low-cost, and reliability will have to be... / or that the computational complexity measured in terms of br loops has a high computational complexity. Moreover for many
3969.9 Decision-Theoretic Planning and Markov Decision Processes - Dean (1994)(Correct)
We propose Markov decision processes as a basic representation for
planning under uncertainty. We present standard notation and terminology
from the literature on the control of stochastic processes.
... / involving expressivity and computational complexity. An expressive br Until recently however computational complexity has prevented most
3940.1 Workflows, Transactions, and Datalog - Bonner (1999)(Correct)
Transaction Datalog (abbreviated T D) is a concurrent programming language that
provides process modeling, database access, and advanced transactions. This paper
illustrates the use of T D for specify... / use T D to explore the computational complexity of workflows in br their influence on the computational complexity of workflows.
3905.9 Theory and Applications of the Shift-Invariant, Time-Varying and.. - Guo (1995)(Correct)
In this thesis, we generalize the classical discrete wavelet transform, and construct
wavelet transforms that are shift-invariant, time-varying, undecimated, and signal
dependent. The result is a set ... / . . Computational Complexity of the DWT br . . The Computational Complexity of the UDWT
3864.2 Logical Characterizations of Complexity Classes - Stewart (1997)(Correct)
Introduction
Prior to 1974, results in finite model theory had appeared only sporadically, e.g.,
Trakhtenbrot's Theorem [74] and the 0-1 law for first-order logic [23]: there had
been no real concert... / striking link between the computational complexity of a problem and whether br it was this link between computational complexity and finite model theory
3837.3 Fast Solution Methods in Electromagnetics - Chew, Jin, Lu, Michielssen, Song (1997)(Correct)
Various methods for efficiently solving electromagnetic problems are presented. Electromagnetic scattering
problems can be roughly classified into surface and volume problems, while fast methods are e... / algorithms with reduced computational complexity and memory requirements br importance of reducing the computational complexity of computational
3833.1 The Use of Context in Large Vocabulary Speech Recognition - Odell (1995)(Correct)
decide which contexts are similar and can share parameters. A key feature of
this approach is that it allows the construction of models which are dependent upon contextual
effects occurring across wo... / performance in terms of computational complexity and recognition accuracy. br Tables . Variation in computational complexity with pruning.
3811.3 Fixpoint Logics, Relational Machines, and Computational Complexity - Abiteboul, Vardi, Vianu (1997)(Correct)
We establish a general connection between fixpoint logic and complexity. On
one side, we have fixpoint logic, parameterized by the choices of 1st-order operators
(inflationary or noninflationary) and ... / Relational Machines and Computational Complexity Serge Abiteboul br Introduction The computational complexity of a problem is the
3804.1 Mixed Finite Element Methods for Flow in Porous Media - Yotov (1996)(Correct)
Mixed finite element discretizations for problems arising in flow in porous medium applications
are considered. We first study second order elliptic equations which model
single phase flow. We conside... / the mortar pressures. The computational complexity is shown to be comparable
3778.0 Relating Relational Learning Algorithms - David Aha (1992)(Correct)
Relational learning algorithms are of special interest to members of the machine learning community; they
offer practical methods for extending the representations used in algorithms that solve superv... /
3757.0 Incremental Constraint-based Parsing: An Efficient Approach for.. - Güngördu (1997)(Correct)
In this dissertation, I provide a left-to-right incremental parsing approach for Headdriven
Phrase Structure Grammar (HPSG; Pollard and Sag (1987, 1994)). HPSG is a
lexicalized, constraint-based theor... / Issues . Computational Complexity . br language. . Computational Complexity In this section I
3738.6 Polynomial Acceleration For Large Nonsymmetric Eigenproblems - Nishida (1997)(Correct)
In this thesis, we propose a highly efficient accelerating method for the restarted Arnoldi iteration
to compute the eigenvalues of a large nonsymmetric matrix. Its effectiveness is proved by
various ... / Its defect of increasing computational complexity per iteration step was br disadvantage of increasing computational complexity per iteration step was
3735.4 The Gauss Center Research in Multiscale Scientific Computation - Achi Brandt (1997)(Correct)
Contents
Page
0. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
0.1 Multiscale computation: general . . . . . . . . . . . . . . . . 3
0.2 Current research directions at the Ga... / reveals that the computational complexity of these problems br . Research steps The computational-complexity factors arising in
3698.5 MGCG Method: A Robust And Highly Parallel Iterative Method - Tatebe (1996)(Correct)
A multigrid preconditioned conjugated gradient (MGCG) method, which is an iterative method
to solve a large sparse matrix, is proposed. The MGCG method is a conjugate gradient method
preconditioned by... / . Comments about Computational Complexity and Parallelism br In both distributions the computational complexity is O n p with n
3597.6 Computational Model Theory: An Overview - Vardi (1998)(Correct)
The computational complexity of a problem is the amount of resources, such as time
or space, required by a machine that solves the problem. The descriptive complexity of
problems is the complexity of ... / Abstract The computational complexity of a problem is the br Introduction The computational complexity of a problem is the
3581.9 Generalized Quantifiers in Computational Complexity Theory - Vollmer (1998)(Correct)
A notion of generalized quantifier in computational complexity theory is
developed and used to give a unified treatment of leaf language definability,
oracle separations, type 2 operators, and circuit... / Quantifiers in Computational Complexity Theory Heribert Vollmer br generalized quantifier in computational complexity theory is developed and
3526.7 Factoring Wavelet Transforms Into Lifting Steps - Daubechies, Sweldens (1996)(Correct)
This paper is essentially tutorial in nature. We show how any discrete wavelet
transform or two band subband filtering with finite filters can be decomposed into a finite
sequence of simple filterin... / asymptotically reduces the computational complexity of the transform by a br how lifting can reduce the computational complexity of the wavelet transform
3507.4 Networks of Spiking Neurons: The Third Generation of Neural Network.. - Maass (1997)(Correct)
The computational power of formal models for networks of spiking neurons
is compared with that of other neural network models based on McCulloch
Pitts neurons (i.e. threshold gates), respectively sigm... / integrate-and-fire neuron computational complexity sigmoidal neural nets br th IEEE Conference on Computational Complexity pp - .
3480.1 Description Logics are not just for the Flightless-Birds: A New Look.. - Borgida (1992)(Correct)
This paper presents some of the underlying principles of description logics (also known
as terminological logics or kl-one-style languages), grounding them in the lattice of terms
organized by the so-... / to the daunting problem of computational complexity posed by reasoning with br Nebel Nebel B.Computational complexity of terminologic reasoning
3450.8 The Use of Coding Theory in Computational Complexity - Feigenbaum (1995)(Correct)
The interplay of coding theory and computational complexity theory is a rich source of
results and problems. This article surveys three of the major themes in this area:
ffl the use of codes to impro... / Use of Coding Theory in Computational Complexity Joan Feigenbaum AT T br of coding theory and computational complexity theory is a rich source
3428.0 Interior Point Methods In Semidefinite Programming With Applications.. - Alizadeh (1995)(Correct)
We study the semidefinite programming problem (SDP), i.e the optimization problem
of a linear function of a symmetric matrix subject to linear equality constraints and the additional
condition that ... / below and even structural computational complexity theory see The br reason their worst case computational complexity is likely to be at least
3426.0 Expressive Power of Declarative Programming Languages - Matsushita (1998)(Correct)
The thesis investigates several aspects of the expressive power of declarative programming
languages.
There seems to be no widely accepted definition of expressive power of programming
languages. In t... / . . Textual complexity computational complexity . br answers but also keeps computational complexity. Resulting functional
3418.6 Order Independent and Persistent Typed Default Unification - Lascarides, Briscoe, Asher, Copestake (1996)(Correct)
We define an order independent version of default unification on typed feature structures.
The operation is one where default information in a feature structure typed with
a more specific type, will o... / We also discuss the computational complexity of default unification in br operation is the computational complexity of the resultant system.
3418.5 A graduated assignment algorithm for graph matching - Gold, Rangarajan (1996)(Correct)
A graduated assignment algorithm for graph matching is presented which is fast and
accurate even in the presence of high noise. By combining graduated non-convexity, twoway
(assignment) constraints, a... / achieved. Its low order computational complexity O lm where l and br have a much lower computational complexity O lm or perhaps
3401.5 On Exploiting Knowledge and Concept Use in Learning Theory - Pitt(Correct)
In the past fifteen years, various formal models of concept
learning have successfully been employed to answer the question of what
types of concepts can be efficiently inferred from examples. The a... / tography and the theory of computational complexity break down Kearns br the relative human computational complexity of various learning
3383.1 Descriptive Complexity of Optimization and Counting Problems - Thakur (1992)(Correct)
viii
Acknowledgments x
1. Introduction to Descriptive Complexity 1
2. Logic Preliminaries 4
I Optimization Problems 7
3. Introduction 8
3.1 Towards a structural theory of optimization problems : : : ... / are called algorithms. Computational complexity theory has traditionally br focussed on the computational complexity of problems which is the
3375.1 Sound and Efficient Closed-World Reasoning for Planning - Etzioni, Golden, Weld (1995)(Correct)
Closed-world reasoning is the process of inferring that a logical
sentence is false based on its absence from a knowledge base,
or the inability to derive it. Previous work on circumscription,
autoepi... / some excellent analyses of computational complexity have emerged br The thorough analyses of computational complexity in have found
3363.7 Sparse Sets versus Complexity Classes - Cai, Ogihara (1996)(Correct)
The study of sparse hard sets and sparse complete sets has
been a central research area in complexity theory for nearly two decades.
Recently new results using unexpected techniques have been obtained... / the past several decades computational complexity theory developed br Electronic Colloquium on Computational Complexity . BDG J.
3358.1 Database Query Languages Embedded in the Typed Lambda Calculus - Hillebrand, Kanellakis, Mairson (1993)(Correct)
We investigate the expressive power of the typed -calculus when expressing computations over
finite structures, i.e., databases. We show that the simply typed -calculus can express various
database qu... / characterization of the computational complexity class PTIME. In this br A. R. Meyer. The Inherent Computational Complexity of Theories of Ordered
3303.1 Multiple Predicate Learning in Two Inductive Logic Programming.. - De Raedt, Lavrac (1996)(Correct)
Inductive logic programming (ILP) is a research area which has its roots in inductive machine learning
and computational logic. The paper gives an introduction to this area based on a distinction betw... / of algorithms and in the computational complexity of procedures. br inconsistent. Due to the computational complexity of backtracking we may
3295.3 Autoepistemic Logic as a Basis for Automating Nonmonotonic Reasoning - Niemelä (1995)(Correct)
Introduction
We study the problem of automating nonmonotonic reasoning, i.e., developing
an automated theorem prover for nonmonotonic reasoning. Several
forms of nonmonotonic reasoning have been prop... / on decidability and computational complexity of autoepistemic br on decidability and computational complexity of autoepistemic
3295.0 Statistical Reconstruction And Analysis Of Autoregressive Signals In.. - Godsill, Rayner (1998)(Correct)
Modelling and reconstruction methods are presented for noise reduction
of autocorrelated signals in non-Gaussian, impulsive noise environments. A
Bayesian probabilistic framework is adopted and Markov... / the expense of some extra computational complexity. Keywords Impulsive br a trade-off in the extra computational complexity involved per iteration.
3291.9 On The Complexity Of Computing Mixed Volumes - Dyer, Gritzmann, Hufnagel (1998)(Correct)
This paper gives various (positive and negative) results on the complexity of the problem of computing and approximating mixed volumes of polytopes and more general convex bodies in arbitrary dimens... / approximation computational complexity deterministic algorithm br addition of polytopes computational complexity and applications to
3270.6 A Study On Inference Control In Natural Language Processing - Miyata (1996)(Correct)
Natural language processing requires flexible control of computation on various sorts of constraints such as
syntax, semantics, pragmatics. This study aims to propose and verify a new approach that de... / from the difference in computational complexity between processing these br which allow to reduce the computational complexity by structure sharing
3248.8 Counting Complexity - Fortnow (1997)(Correct)
Traditionally, computational complexity theorists have looked
at NP problems like three-coloring to determine whether some solution exists.
In counting complexity, we ask how many solutions exist. Thi... / ABSTRACT Traditionally computational complexity theorists have looked at br an important role in computational complexity theory and theoretical
3245.8 Orthonormal Shift-Invariant Adaptive Local Trigonometric Decomposition - Cohen, Raz, Malah (1997)(Correct)
In this paper, an extended library of smooth local trigonometric bases is defined, and an appropriate fast "best-basis" search algorithm is introduced. When compared with the standard local cosine dec... / the representation. The computational complexity is manageable and br is allowed or immense computational complexity e.g.the matching
3239.2 Finite Representation of Infinite Query Answers - Chomicki, Imielinski (1992)(Correct)
We define here a formal notion of finite representation of infinite query answers in
logic programs. We apply this notion to Datalog nS (Datalog with n successors): an extension of
Datalog capable ... / decidability safety computational complexity non-standard query br In Section we discuss computational complexity issues. In Section we
3234.0 The Model Checker SPIN - Holzmann (1997)(Correct)
SPIN is an efficient verification system for models of distributed software systems. It has been used to detect design
errors in applications ranging from high-level descriptions of distributed algori... / The fundamental computational complexity of the problem to be
3220.8 A Survey of Complexity Results for Planning - Cadoli (1993)(Correct)
Recently several works about the computational complexity of
planning appeared in the literature. In this paper we survey the main
results in this area. We not only give results about the tractability... / several works about the computational complexity of planning appeared in br works about the intrinsic computational complexity of planning appeared in
3209.4 Scalability Of Machine Learning Algorithms - Paliouras (1993)(Correct)
10
The Author 13
Acknowledgements 15
1 Introduction 16
1.1 Definition of Learning : : : : : : : : : : : : : : : : : : : : : : : : 16
1.2 The objectives of ML : : : : : : : : : : : : : : : : : : : : :... / on their worst-case computational complexity. The obtained results br although their worst-case computational complexity is over-quadratic most
3203.3 Number-Theoretic Constructions of Efficient Pseudo-Random Functions - Naor, Reingold (1997)(Correct)
We describe efficient constructions for various cryptographic primitives (both in privatekey
and in public-key cryptography). We show these constructions to be at least as secure as
the decisional ver... / . Has applications to computational complexity i.e.Natural Proofs br Electronic Colloquium on Computational Complexity O. Goldreich S.
3185.0 Automatic Symbolic Verification of Embedded Systems - Alur, Henzinger, Ho (1996)(Correct)
We present a model-checking procedure and its implementation for the automatic
verification of embedded systems. The system components are described as Hybrid
Automata---communicating machines with... / Although in theory the computational complexity of the verification
3177.3 Flat Minima - Sepp Hochreiter, Jürgen Schmidhuber (1997)(Correct)
We present a new algorithm for finding low complexity neural networks with high generalization
capability. The algorithm searches for a "flat" minimum of the error function. A
flat minimum is a large ... / backprop's order of computational complexity. Automatically the br has the same order of computational complexity as standard backprop.
3173.1 Finite Model Theory in the Simply Typed Lambda Calculus - Hillebrand (1994)(Correct)
Church's simply typed -calculus is a very basic framework for functional programming
language research. However, it is common to augment this framework with additional
programming constructs, because ... / model theory and thus computational complexity database theory and br A. Meyer. The Inherent Computational Complexity of Theories of Ordered
3172.9 Metafinite Model Theory - Grädel, Gurevich (1997)(Correct)
Motivated by computer science challenges, we suggest to extend the approach and
methods of finite model theory beyond finite structures. We study definability issues
and their relation to complexity o... / Leivant Ed.Logic and Computational Complexity Springer br them for instance to computational complexity. Fault-tolerance of
3172.8 Counting in Lattices: Combinatorial Problems from Statistical.. - Randall (1994)(Correct)
In this thesis we consider two classical combinatorial problems arising in statistical mechanics:
counting matchings and self-avoiding walks in lattice graphs. The first problem
arises in the study of... / . Computational complexity of counting problems br in the framework of computational complexity theory finally section
3154.8 Efficient Approximations for the Marginal Likelihood of Bayesian.. - Chickering, Heckerman (1996)(Correct)
We discuss Bayesian methods for model averaging and model selection among Bayesiannetwork
models with hidden variables. In particular, we examine large-sample approximations
for the marginal likelihoo... / methods it has a computational complexity of O d N br for our experiments. . Computational Complexity The accuracy of these
3154.2 Using Compiled Knowledge to Guide and Focus Abductive Diagnosis - Console, Portinale, Dupré (1996)(Correct)
Several artificial intelligence architectures and systems based on "deep" models of a domain have been
proposed, in particular for the diagnostic task. These systems have several advantages over tradi... / a main limitation in their computational complexity. One of the ways to face br approach is its computational complexity. Model-based diagnosis
3153.5 SIGACT News Complexity Theory Column 19 - Hemaspaandra (1997)(Correct)
this paper describes the complete problems that motivate interest in these classes,
discusses some surprising recent discoveries, and points out open problems where progress can
reasonably be expected... / the editor-in-chief of computational complexity has written me pointing br connection with Boolean computational complexity is possible if the model
3143.3 Vector Quantization with Complexity Costs - Buhmann, Kühnel (1993)(Correct)
Vector quantization is a data compression method where a set of data points is encoded by a reduced set of reference vectors, the codebook. We discuss a vector quantization strategy which jointly opti... / common for many Computational complexity issues like the br Thereby the computational complexity would be drastically
3104.8 Modeling Heterogeneous Network Traffic in Wavelet Domain: Part I -.. - Ma, Ji (1999)(Correct)
Heterogeneous network traffic possesses diverse statistical properties such as (1) complex temporal correlation,
(2) higher-order statistics and (3) a certain (such as periodic) structure. The Part I ... / and have the lowest computational complexity attainable in developing br of a model and the computational complexity needed to develop such a
3101.7 A Survey on Knowledge Compilation - Cadoli, Donini (1998)(Correct)
this paper
we survey recent results in knowledge compilation of
propositional knowledge bases. We first define and limit the
scope of such a technique, then we survey exact and approximate
knowledge c... / scientists for their high computational complexity. As an example if the br has some basic notions of computational complexity concepts we refer to
3096.3 Coalitions among Computationally Bounded Agents - Sandholm, Lesser(Correct)
This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate efficiently in the world. By colluding (coordinating their actions by solv... / rationality is bounded by computational complexity. Abbreviated br targeted to reduce the computational complexity in the number of
3083.1 On the Equivalence of Recursive and Nonrecursive Datalog Programs - Chaudhuri (1992)(Correct)
We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equivalent to unions of c... / a detailed study of the computational complexity of containment and
3067.7 Is Intractability of Non-Monotonic Reasoning a Real Drawback? - Cadoli, Donini, Schaerf (1995)(Correct)
Several studies about computational complexity of non-monotonic
reasoning (NMR) showed that non-monotonic inference is significantly
harder than classical, monotonic inference. This contrasts with the... / Several studies about computational complexity of non-monotonic br theoretical results on its computational complexity and also to some
3051.6 Complexity, Decidability and Undecidability Results for.. - Erol, Nau, Subrahmanian (1991)(Correct)
In this paper, we examine how the complexity of domain-independent planning with
STRIPS-style operators depends on the nature of the planning operators.
We show conditions under which planning is deci... / have begun to examine the computational complexity of planning problems and br is decidable the computational complexity varies from constant
2994.1 Asymptotic Results for Multiplexing Subexponential On-Off Processes - Jelenkovic, Lazar (1998)(Correct)
Consider an aggregate arrival process A
N
obtained by multiplexing N On-Off processes with
exponential Off periods of rate and subexponential On periods ø
on
. As N goes to infinity, with
N ! , ... / approximation with low computational complexity of the large buffer br has basically negligible computational complexity. To the best of our
2965.3 A Family Of Preconditioned Iterative Solvers For Sparse Linear Systems - Yang (1995)(Correct)
ng a parametrized preconditioner whenever poor convergence or instability
is encountered. We present numerical experiments that demonstrate the efficiency of
several members of this new family in comp... / must be considered. The computational complexity per iteration step of br versions. Additionally computational complexity with regard to operations
2945.2 Phoneme Probability Estimation with Dynamic Sparsely Connected.. - Ström (1997)(Correct)
This paper presents new methods for training large neural networks for phoneme
probability estimation. An architecture combining time-delay windows and
recurrent connections is used to capture the imp... / detail a difference in computational complexity can be noted. The amount
2943.6 Flat Minimum Search Finds Simple Nets - Hochreiter, Schmidhuber (1994)(Correct)
We present a new algorithm for finding low complexity neural networks with high generalization capability. The algorithm searches for a "flat" minimum of the error function. A flat minimum is a large ... / backprop s order of computational complexity. Automatically the br has the same order of computational complexity as standard backprop.
2914.5 First Year Review - Matthews (1992)(Correct)
This document introduces the concept of 3D environmental structure
and sensor motion recovery from 2D image sequences and more especially
the concept of an optical flow field. Problems inherent in bot... / Computational complexity Noise . br Computational complexity
2904.6 Deterministic and Non-Deterministic Stable Models - Sacca, Zaniolo (1997)(Correct)
Stable models have been first introduced in the domain of total interpretations (T-
stable models), where the existence of multiple T-stable models for the same program
provides a powerful mechanism ... / and characterizes the computational complexity of finding stable models br Models To discuss the computational complexity of stable models we
2877.3 Six Hypotheses in Search of a Theorem - Buhrman, Fortnow, Torenvliet (1997)(Correct)
We consider the following six hypotheses:
ffl P = NP.
ffl SAT is truth-table reducible to a P-selective set.
ffl SAT is truth-table reducible to a k-
approximable set for some k.
ffl FP
NP
jj =... / of NP-complete sets. Computational Complexity - . br th anual conference on Computational Complexity pages - . IEEE
2861.1 Approximate Inference in Default Logic and Circumscription - Marco Cadoli (1992)(Correct)
We propose a technique for dealing with the high complexity
of reasoning under propositional default logic and circumscription.
The technique is based on the notion of approximation: A logical conse... / formalisms is their high computational complexity. As shown by several br has exactly the same computational complexity. In this paper we are
2850.0 Decidable Reasoning in Terminological Knowledge Representation Systems - Buchheit, Donini, Schaerf (1993)(Correct)
Terminological knowledge representation systems (TKRSs) are tools for designing and
using knowledge bases that make use of terminological languages (or concept languages).
We analyze from a theoretica... / Recent research on the computational complexity of subsumption had an br Nutt Also beyond computational complexity pure subsumption was
2825.6 Transforming Prioritized Defaults and Specificity into Parallel.. - Grosof (1995)(Correct)
and Summary
We show how to transformany set of prioritized propositional
defaults into an equivalent set of parallel (i.e., unprioritized)
defaults, in circumscription. We give an algorithm to implem... / expressive reduction s computational complexity suggests that br member of GR E Computational Complexity of the General Transform
2815.5 Largest j-Simplices In d-Cubes: Some Relatives Of The Hadamard.. - Hudelson, Klee, Larman (1996)(Correct)
This paper studies the computationally difficult problem of finding a largest j-dimensional
simplex in a given d-dimensional cube. The case in which j = d is of special interest, for it is
equival... / we do not expect the computational complexity to be much better when br in GKL concern the computational complexity of finding a largest
2815.3 Wavelet Based Modeling Of Nonlinear Systems - Yu, Lawton, Lee, Tan, Vandewalle(Correct)
This paper formulates the nonlinear system modeling problem as a
scattered data interpolation problem, and develops a new method that computes
interpolants that minimize a wavelet-based norm subject... / from two weaknesses computational complexity and lack of spatial
2813.0 Learning an Optimally Accurate Representation System - Greiner, Schuurmans (1994)(Correct)
A default theory can sanction different, mutually incompatible,
answers to certain queries. We can identify each such theory with
a set of related credulous theories, each of which produces but a si... / and by coping with the computational complexity inherent in this br confidence terms and its computational complexity is dominated by the cost
2805.8 Dynamic Recurrent Neural Networks - Pearlmutter (1990)(Correct)
We survey learning algorithms for recurrent neural networks with hidden units and attempt
to put the various techniques into a common framework. We discuss fixpoint learning algorithms,
namely recurre... / and at the end issues of computational complexity are addressed. This br This favorable computational complexity makes it of practical
2800.3 Accelerating Markovian Analysis of Asynchronous Systems using State.. - Xie, Beerel(Correct)
This paper presents a methodology to speed up
the stationary analysis of large Markov chains that model
asynchronous systems. Instead of directly working on the
original Markov chain, we propose to an... / method to reduce the computational complexity. The method we propose br is limited by exploding computational complexity. We briefly discuss the
2796.1 A Computational Model for Detecting Image Changes - Wai (1994)(Correct)
This thesis proposes a model that investigates a new avenue for attention control based
on dynamic scenes. We have derived a computational model to detect abrupt changes and
have examined how the most... / in Computer Vision Computational complexity is a measure of the cost
2774.4 On the Construction of Pseudo-Random Permutations: Luby-Rackoff.. - Naor, Reingold (1997)(Correct)
Luby and Rackoff [27] showed a method for constructing a pseudo-random permutation from
a pseudo-random function. The method is based on composing four (or three for weakened security)
so called Feist... / Electronic Colloquium on Computational Complexity Reports Series - br an improvement in the computational complexity of the pseudo-random
2760.6 An Approach to Learning Mobile Robot Navigation - Thrun (1995)(Correct)
This paper describes an approach to learning a simple indoor robot navigation
task through trial-and-error. A mobile robot, equipped with visual, ultrasonic
and laser sensors, learns to servo to a des... / found to be of enormous computational complexity see for example br Moreover the computational complexity often increases
2758.0 Survey of Anders Yeo's papers - In This(Correct)
oured graphs and
digraphs (see section 4), tournaments (see section 3) and some problems in extremal graph
theory (see section 5). I have, together with J. Bang-Jensen and J. Huang, introduced the
not... / as well as deciding the computational complexity of the problems. The
2742.2 On TC 0 , AC 0 , and Arithmetic Circuits - Agrawal, Allender, Datta (1997)(Correct)
Continuing a line of investigation that has studied
the function classes #P [Val79b], #SAC
1
[Val79a, Vin91,
AJMV], #L [AJ93b, Vin91, AO94], and #NC
1
[CMTV96],
we study the class of functions #AC... / since it characterizes the computational complexity of such important br Annual IEEE Conference on Computational Complexity pages - .
2722.5 Heuristic Reasoning For An Automatic Commonsense Understanding Of.. - Salvador Mir (1994)(Correct)
5
Declaration 6
Preface 7
Acknowledgements 8
Abbreviations 10
Symbols 11
List of Tables 13
List of Figures 14
I Expert Knowledge and Problem Formulation 17
1 Introduction 18
1.1 Motivations of the R... / for avoiding the critical computational complexity of the problem. br to manage the exponential computational complexity of the reasoning methods.
2721.8 Tabu Search on the Geometric Traveling Salesman Problem - Dam, Zachariasen (1994)(Correct)
The Traveling Salesman Problem (TSP) is probably the most well-known problem of its
genre: Combinatorial Optimization. New heuristics, built on the concept of local search,
i.e. continuously to make t... / A Computational complexity A. The complexity br memory requirements and computational complexity can be made moderate by
2706.1 P-Selective Sets, and Reducing Search to Decision vs.. - Hemaspaandra, Naik, Ogiwara, Selman (1996)(Correct)
We obtain several results that distinguish self-reducibility of a language L
with the question of whether search reduces to decision for L. These include:
(i) If NE 6= E, then there exists a set L in... / cheatable. Keywords computational complexity complexity classes br of internal structure on computational complexity. In A. Selman editor
2703.6 Probabilistic Proof Systems (A Survey) - Goldreich (1996)(Correct)
Various types of probabilistic proof systems have played a central role in the development
of computer science in the last decade. In this exposition, we concentrate
on three such proof systems --- in... / bounds are imposed on the computational complexity of the verification br Interactive Protocols. Computational Complexity Vol. No. pages
2699.6 Multiscale Modeling and Estimation of Motion Fields for Video Coding - Moulin (1997)(Correct)
We present a systematic approach to forward--motion--compensated predictive video coding. The
first step is the definition of a flexible model that compactly represents motion fields. The inhomogeneit... / methods. ffl Computational complexity is a significant br Storage Complexity The computational complexity is O N for a full
2699.3 The Complexity of Revising Logic Programs - Greiner (1996)(Correct)
A rule-based program will return a set of answers to each query. An impure program,
which includes the Prolog cut "!" and "not(\Delta)" operators, can return different
answers if its rules are re-orde... / Logic Programming Computational Complexity Approximatability br also considers the computational complexity of modifying a theory.
2692.9 Hierarchical Discriminant Analysis for Image Retrieval - Swets, Weng (1996)(Correct)
A self-organizing framework for object recognition is described. We describe a
hierarchical database structure for image retrieval. The SHOSLIF (Self-Organizing Hierarchical
Optimal Subspace Learning ... / to achieve a very low computational complexity in the retrieval phase. br in the testing phase the computational complexity of this operation is
2686.4 A Random Sampling Scheme for Path Planning - Barraquand, Kavraki, Latombe, Li.. (1996)(Correct)
Several randomized path planners have been proposed during the last few years. Their attractiveness
stems from their applicability to virtually any type of robots, and their empirically
observed succe... / the basic problem adds in computational complexity. For instance allowing
2686.3 Query Order and Self-Specifying Machines - Hemaspaandra, Hempel, Wechsung (1995)(Correct)
We study the computational power of machines that specify their own acceptance
types, and we show that they accept exactly the languages in R
#P
m (NP).
We study the effect of query order on computa... / we refer the reader to any computational complexity textbook e.g. br Pap C. Papadimitriou. Computational Complexity. Addison-Wesley .
2680.9 Face Recognition: A Convolutional Neural Network Approach - Lawrence, Giles, Tsoi, Back (1997)(Correct)
Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult [43]. We present a hybrid neural network solution which comp... / facial details. We analyze computational complexity and discuss how new br in sections and . Computational complexity is considered in section
2677.9 The Hardness of Problems on Thin Colored Graphs - Bodlaender, Fellows, Hallett.. (2000)(Correct)
In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directe... / . Parameterized Computational Complexity . Parameterized br W. H. Day D. Sankoff. Computational complexity of inferring phylogenies
2667.6 Face Recognition: A Hybrid Neural Network Approach - Lawrence, Giles, Tsoi, Back (1996)(Correct)
Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational
model for face recognition is difficult (Turk and Pentland, 1991). We present a hybrid neural
networ... / facial details. We analyze computational complexity and discuss how new br in sections and . Computational complexity is considered in section
2663.2 Navigation in Hypertext is Easy Only Sometimes - Mark Levene(Correct)
One of the main unsolved problems confronting Hypertext is the navigation
problem, namely the problem of having to know where you are in the database graph representing
the structure of a Hypertext ... / logic finite automata computational complexity AMS MOS subject br we investigate the computational complexity of the model checking
2632.5 Graph Isomorphism Is Low For PP - Köbler, Schöning, Torán (1992)(Correct)
We show that the graph isomorphism problem is low for PP and for
C= P, i.e., it does not provide a PP or C=P computation with any additional
power when used as an oracle. Furthermore, we show that g... / . J. Gill Computational complexity of probabilistic Turing br some central problems in computational complexity Ph.D. Thesis Cornell
2623.2 Structure in Approximation Classes - Crescenzi, Kann, Silvestri, Trevisan (1995)(Correct)
this paper we obtain new results on the structure of
several computationally-defined approximation classes. In particular, after defining a new approximation
preserving reducibility to be used for as ... / with the basic concepts of computational complexity theory. For the br C.H. Computational complexity. Addison-Wesley. .
2612.8 On the Hardness of Approximate Reasoning - Roth (1996)(Correct)
Many AI problems, when formalized, reduce to evaluating the probability that a propositional expression is true. In this paper we show that this problem is computationally intractable even in surprisi... / We analyze the computational complexity of counting satisfying br material from the computational complexity of counting problems
2611.5 Efficient Multiscale Regularization with Applications to the.. - Luettgen, Karl, Willsky (1993)(Correct)
A new approach to regularization methods for image processing is introduced and
developed using as a vehicle the problem of computing dense optical flow fields in an
image sequence. Standard formulati... / in fact has a per pixel computational complexity which is independent of br method is employed computational complexity per pixel typically
2610.7 Labeling Point Features on Maps and Diagrams - Christensen, Marks, Shieber (1992)(Correct)
A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display
features (including other labels) as a result of spatial overlap. Poin... / algorithm. The Computational Complexity of PFLP In this br Analysis of the computational complexity of the problem bears out
2608.6 Some Studies in Distributed Machine Learning and Organizational Design - Weiss (1994)(Correct)
This article focusses on the intersection of distributed machine learning and organizational design in the context of multi-agent systems. A computational approach to distributed reinforcement learn... / learning approach was its computational complexity which increased almost
2600.1 Computing Equilibria for Two-Person Games - von Stengel (1997)(Correct)
This paper is a self-contained survey of algorithms for computing
Nash equilibria of two-person games given in normal form or extensive
form. The classical Lemke--Howson algorithm for finding one eq... / will touch the issue of computational complexity and mention ongoing br arising from games. The computational complexity of finding one
2595.3 A Survey of Continuous-Time Computation Theory - Orponen (1997)(Correct)
Motivated partly by the resurgence of neural computation research, and partly by
advances in device technology, there has been a recent increase of interest in analog,
continuous-time computation. How... / right at the heart of computational complexity research. While the br is practically none on the computational complexity aspects -even such
2595.2 Probabilistic and Truth-Functional Many-Valued Logic Programming - Thomas Lukasiewicz (1998)(Correct)
We introduce probabilistic many-valued logic programs in which the implication
connective is interpreted as material implication. We show that probabilistic many-valued logic
programming is computat... / on the subtleties and the computational complexity of probabilistic br Pr n have the same computational complexity like their classical
2591.1 Generally Applicable Heuristics for Global Optimisation: An.. - Telfar (1994)(Correct)
The purpose of this reading paper is to empirically analyse and compare
several heuristic algorithms that can be applied to combinatorial optimisation
problems. The main focus of the paper is heuristi... / . Computational Complexity br of the theory of computational complexity. It was discovered that
2578.3 Asymptotic Results for Multiplexing Subexponential On-Off Sources - Jelenkovic, Lazar (1997)(Correct)
Consider an aggregate arrival process A
N
obtained by multiplexing N On-Off
sources with exponential Off periods of rate and subexponential On periods ø
on
.
When N goes to infinity, with N ! , A... / approximation with low computational complexity of the large buffer br has basically negligible computational complexity To the best of our
2572.9 Reinforcement Learning With Self-Modifying Policies - Jürgen Schmidhuber, Jieyu Zhao.. (1997)(Correct)
A learner's modifiable components are called its policy. An algorithm that modifies the
policy is a learning algorithm. If the learning algorithm has modifiable components represented
as part of the p... / has the optimal order of computational complexity for a broad class of br Kolmogorov complexity and computational complexity. EATCS Monographs on
2567.3 The Decidability of Simultaneous Rigid E-Unification with One Variable - Degtyarev, Al. (1997)(Correct)
We show that simultaneous rigid E-unification, or SREU for short, is
decidable and in fact EXPTIME-complete in the case of one variable.
This result implies that the 8
98
fragment of intuitionis... / algebras and their computational complexity have been studied in br we will address the computational complexity of this reduction. .
2563.7 Complexity Results for First-Order Theories of Temporal Constraints - Koubarakis (1994)(Correct)
We study the complexity of quantifier elimination
and decision in first-order theories of
temporal constraints. With the exception of
Ladkin, AI researchers have largely ignored
this problem. We consi... / on temporal constraints computational complexity of logical theories br McAloon and C. Tretkoff. Computational Complexity and Constraint Logic
2554.5 Problems in Communication Network Design and Location Planning; New.. - Gupta (1996)(Correct)
This effort aims to make contributions in two areas of research. One is the area of
communication network design. We present new models and solution procedures that are
directed at providing efficient... / . . Computational Complexity of Problem STAR-TREE br . . Computational Complexity of Problem TTREE
2553.2 Flexible Syntactic Matching of Curves and its Application to.. - Yoram Gdalyahu(Correct)
The organization of image databases can rely upon
different aspects of image similarity. Here we extract
silhouettes from images of three dimensional
objects, and rely upon curve similarity for image
... / methods are their high computational complexity which is reduced br To achieve low computational complexity we focus on syntactic
2545.4 Safe Query Languages for Constrained Databases - Revesz(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on
servers, to redistribute to lists, or to use any component of this work in other works, requires prior
specific permission and... / is the measure of the computational complexity of fixed queries as the br Section shows that the computational complexity of testing whether
2544.3 DISCO: A Constraint Database System with Sets - Byon, Revesz (1995)(Correct)
This paper describes the implementation of a constraint database
system with integer and set of integers data types. The system called
DISCO allows Datalog queries and input databases with both inte... / complexity measures the computational complexity of evaluating fixed size
2544.2 Analogy, Decision, And Theory-Formation As Defeasible Reasoning - Loui (1993)(Correct)
The development of computationally informed formalisms for reasoning with defeasible
rules affords new accounts of familiar forms of reasoning. This paper points to recent
accounts of defeasible rea... / here is not directly with computational complexity classes. Rather the
2540.5 Quantum Computing and Phase Transitions in Combinatorial Search - Hogg (1996)(Correct)
We introduce an algorithm for combinatorial search on quantum computers that is capable
of significantly concentrating amplitude into solutions for some NP search problems,
on average. This is done by... / evaluating algorithms computational complexity theory usually focuses on
2537.0 Defeasible and Pointwise Prioritization - Benjamin N. Grosof (1995)(Correct)
We suggest why, and show how, to represent defeasible reasoning about
prioritization-type precedence. We define Defeasible Axiomatized Policy
(DAP) circumscription: it is the first formalism to expres... / the cost in formal and or computational complexity in doing so is not too br not require much greater computational complexity than prioritized
2534.8 Formalising the Common Sense of a Mobile Robot - Santos (1998)(Correct)
Looking at the history of Artificial Intelligence, often theoretical rigor seems inversely
proportional to practical applicability. Particularly, in the field of robotics,
there is a gap between the r... / the analysis of the computational complexity of the framework in br the main results about its computational complexity section presents the
2531.9 Traffic Models in Broadband Telecommunication Networks - Adas (1996)(Correct)
Traffic models are at the heart of any performance evaluation of telecommunications networks.
An accurate estimation of network performance is critical for the success of broadband
networks. Such netw... / the expense of increased computational complexity. For a given state br models is not. The computational complexity of the analytical
2524.2 Computational Geometry I - Lee (1996)(Correct)
Introduction
Computational geometry, since its inception[41] in 1975, has received a great deal of attention
from researchers in the area of design and analysis of algorithms. It has evolved
into a d... / It is concerned with the computational complexity of geometric problems br context is to study the computational complexity giving lower bounds of
2514.5 Planning and Scheduling - Dean, Kambhampati(Correct)
this article, we provide a framework for characterizing planning and scheduling problems
that focuses on properties of the underlying dynamical system and the capabilities of the
planning system to ob... / in the worst case. The computational complexity of planning problems
2496.8 Two Constructive Methods for Designing Compact Feedforward Networks.. - Amaldi, Guenin (1997)(Correct)
We propose two algorithms for constructing and training compact feedforward networks
of linear threshold units. The Shift procedure constructs networks with a single hidden layer
while the PTI constru... / other hand some recent computational complexity results imply that br first one pertains to the computational complexity of training single linear
2474.1 Complexity, Decidability and Undecidability Results for.. - Erol, Nau, Subrahmanian (1994)(Correct)
In this paper, we examine how the complexity of domain-independent planning
with STRIPS-style operators depends on the nature of the planning operators.
We show conditions under which planning is deci... / have begun to examine the computational complexity of planning problems and br is decidable the computational complexity varies from constant
2467.9 Newton: Constraint Programming over Nonlinear Real Constraints - Van Hentenryck, Michel (1997)(Correct)
This paper is an introduction to Newton, a constraint programming language over nonlinear real
constraints. Newton originates from an effort to reconcile the declarative nature of constraint
logic pro... / due to their inherent computational complexity i.e.they are NP-hard br between pruning and computational complexity. In this section we
2467.8 Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995)(Correct)
Combinatorial optimization problems appear in many disciplines ranging
from management and logistics to mathematics, physics, and chemistry. These
problems are usually relatively easy to formulate mat... / strongly related to the computational complexity of the considered br natural link between the computational complexity of a class of problems
2462.4 Probabilistic Verification of Proofs - Sudan (1998)(Correct)
Recent research in the theory of computing has led to the following
intriguing result. "There exists a probabilistic verifier for proofs of
mathematical assertions that looks at a proof in only a co... / Keywords and Phrases Computational complexity Algorithms br interactive protocols. Computational Complexity - . L.
2458.7 Attributed Tree Matching and Maximum Weight Cliques - Pelillo, Siddiqi, Zucker (1999)(Correct)
A classic way of matching relational structures consists of finding a maximum clique in a
derived "association graph." However, it is not clear how to apply this approach to problems
where the graphs ... / an obvious corollary the computational complexity of finding a maximum
2455.1 Forecasting Financial Time Series with Correlation Matrix Memories.. - Kustrin (1998)(Correct)
High frequency forecasts have always been considered difficult to generate and generation of
forecast distributions instead of point forecasts has always been desired by the practitioners
in asset all... / . . . Computational Complexity for the Training Stage . br . . . Computational Complexity for the Forecasting Stage
2444.2 Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997)(Correct)
We consider the problem of placing a specified number (p) of facilities on the nodes
of a network so as to minimize some measure of the distances between facilities. This
type of problem models a numb... / Approximation Algorithms Computational Complexity NP- hardness.
2439.9 Subexponentially Computable Truncations of Jones-type Polynomials - Przytycka, Przytycki(Correct)
We show that an essential part of the new (Jones-type) polynomial link
invariants can be computed in subexponential time. This is in a sharp contrast to the
result of Jaeger, Vertigan and Welsh that... / of links is their computational complexity practically all old link br D.J.A.Welsh. On the Computational Complexity of the Jones and Tutte