• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 86,438
Next 10 →

The Computational Complexity of Propositional STRIPS Planning

by Tom Bylander - Artificial Intelligence , 1994
"... I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre- and postconditions, by restricting negation ..."
Abstract - Cited by 363 (3 self) - Add to MetaCart
I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre- and postconditions, by restricting negation

Computational Complexity: A Modern Approach

by Sanjeev Arora, Boaz Barak , 2006
"... ..."
Abstract - Cited by 361 (2 self) - Add to MetaCart
Abstract not found

The knowledge complexity of interactive proof systems

by Shafi Goldwasser, Silvio Micali, Charles Rackoff - , 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian. In th ..."
Abstract - Cited by 1246 (39 self) - Add to MetaCart
/non-Hamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given

Parameterized Complexity

by Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen , 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract - Cited by 1213 (77 self) - Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs

Monotone Complexity

by Michelangelo Grigni , Michael Sipser , 1990
"... We give a general complexity classification scheme for monotone computation, including monotone space-bounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract - Cited by 2825 (11 self) - Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone space-bounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a

The computational complexity of provability in systems of modal propositional logic

by Richard E. Ladner - SIAM Journal of Computing , 1977
"... Abstract. The computational complexity of the provability problem in systems of modal proposi-tional logic is investigated. Every problem computable in polynomial space is log space reducible to the provability problem in any modal system between K and $4. In particular, the provability problem in K ..."
Abstract - Cited by 241 (0 self) - Add to MetaCart
Abstract. The computational complexity of the provability problem in systems of modal proposi-tional logic is investigated. Every problem computable in polynomial space is log space reducible to the provability problem in any modal system between K and $4. In particular, the provability problem

Computer Vision

by Kusuma Kumari B. M , 1982
"... Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person behind ..."
Abstract - Cited by 1041 (11 self) - Add to MetaCart
Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person

Statistical mechanics of complex networks

by Réka Albert, Albert-lászló Barabási - Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract - Cited by 2148 (11 self) - Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled

Quantum complexity theory

by Ethan Bernstein, Umesh Vazirani - in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM , 1993
"... Abstract. 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 model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract - Cited by 574 (5 self) - Add to MetaCart
Abstract. 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 model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97

Linguistic Complexity: Locality of Syntactic Dependencies

by Edward Gibson - COGNITION , 1998
"... This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory -- the Syntactic Prediction Locality Theory (SPLT) -- has two components: an integration cost component and a component for the memory cost associa ..."
Abstract - Cited by 504 (31 self) - Add to MetaCart
This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory -- the Syntactic Prediction Locality Theory (SPLT) -- has two components: an integration cost component and a component for the memory cost
Next 10 →
Results 1 - 10 of 86,438
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University