Suchergebnisse - Computational complexity and computability

Feasible Real Random Access Machines von Brattka, Vasco, Hertling, Peter

“… Using a logarithmic complexity measure we prove that all functions computable on a RAM in time O …”
Volltext

Computational Complexity in Analysis: Invited Presentation at Seventh International Conference on Computability and Complexity in Analysis von Rettinger, Robert

Volltext

The Computational Complexity of Subclasses of Semiperfect Rings von Wu, Huishan

“… This paper studies the computational complexity of subclasses of semiperfect rings from the perspective of computability theory …”
Volltext

Freezing, Bounded-Change and Convergent Cellular Automata von Ollinger, Nicolas, Theyssier, Guillaume

“… This paper studies three classes of cellular automata from a computational point of view …”
Volltext

Computable and computational complexity theoretic bases for Herbert Simon’s cognitive behavioral economics von Velupillai, K.Vela, Kao, Ying-Fang

“… This paper aims to interpret and formalize Herbert Simon’s cognitive notions of bounded rationality, satisficing and heuristics in terms of computability theory and computational complexity theory …”
Volltext

Uniform computational complexity of the derivatives of C∞-functions: Computability and complexity in analysis von BLÄSER, Markus

Volltext

Proceedings, Thirteenth Annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference), June 15-18, 1998, Buffalo, New York, USA von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science

Volltext

Proceedings : twentieth Annual IEEE Conference on Computational Complexity : 11-15 June 2005, San Jose, CA von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory

Volltext

Proceedings : 19th IEEE Annual Conference on Computational Complexity : 21-24 June 2004, Amherst, Massachusetts von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory

Volltext

Recent advances in real complexity and computation : UIMP-RSME Lluís A. Santaló Summer School, recent advances in real complexity and computation, July 16-20, 2012, Universidad Internacional Menéndez Pelayo, Santander, Spain von UIMP-RSME Santaló Summer School, Montana, Jose Luis, Pardo, L. M. (Luis M.)

“… ?'' These papers cover several aspects of this problem: from numerical to symbolic methods in polynomial equation solving, computational complexity aspects …”
Volltext

The computational complexity of module socles von Wu, Huishan

“… This paper studies the computational complexity of socles of modules from the viewpoint of computability theory. The socle Soc(M …”
Volltext

Proceedings : twenty-second Annual IEEE Conference on Computational Complexity CCC 2007 : San Diego, California, June 13-16, 2007 von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory

Volltext

Proceedings : twenty-first Annual IEEE Conference on Computational Complexity (CCC 2006) : 16-20 June 2006, Prague, Czech Republic von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory

Volltext

Proceedings, Fourteenth Annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference), May 4-6, 1999, Atlanta, Georgia, USA von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science

Volltext

Proceedings, Twelfth Annual IEEE Conference on Computational Complexity (formerly: Structure in Complexity Theory Conference), June 24-27, Ulm, Germany von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science

Volltext

Proceedings, 15th Annual IEEE Conference on Computational Complexity, July 4-7, 2000, Florence, Italy von IEEE Conference on Computational Complexity, IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing, ACM Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science

Volltext

Closed Sets and Operators thereon: Representations, Computability and Complexity von Rösnick-Neugebauer, Carsten

“… In this paper we refine these investigations from the point of view of computational complexity …”
Volltext

Handbook of Mathematical Models for Languages and Computation von Meduna, Alexander, Horáček, Petr, Tomko, Martin

“… , programming language design, computer architecture and more. To grasp topics concerning this theory readers need to familiarize themselves with its computational …”
Volltext

The Computational Complexity of Propositional Cirquent Calculus von Bauer, Matthew Steven

“… Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive …”
Volltext

Aspects of complexity : minicourses in algorithmics, complexity, and computational algebra, mathematics workshop, Kaikoura, January 7-15, 2000 von Downey, R. G. (Rod G.), Hirschfeldt, Denis, Mathematics Workshop (NZMRI summer workshop)

“… The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students …”
Volltext