Search results for "computational and structural complexity"

Found 15 publication records. Showing 15 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Marcus Schaefer, Frank Stephan	Strong Reductions and Immunity for Exponential Time.	STACS	2003	DBLP DOI BibTeX RDF	hardness for exponential time, polynomial time reducibilities, Computational and structural complexity
2	Pierre Fraigniaud, Cyril Gavoille	A Space Lower Bound for Routing in Trees.	STACS	2002	DBLP DOI BibTeX RDF	compact routing, Algorithms and data structures, computational and structural complexity
2	Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe	If P != NP Then Some Strongly Noninvertible Functions Are Invertible.	FCT	2001	DBLP DOI BibTeX RDF	Computational and Structural Complexity
2	Torben Hagerup, Torsten Tholey	Efficient Minimal Perfect Hashing in Nearly Minimal Space.	STACS	2001	DBLP DOI BibTeX RDF	sparse tables, space complexity, algorithms and data structures, perfect hashing, Computational and structural complexity
1	Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas	Approximation Algorithms for 3D Orthogonal Knapsack.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	geometric configurations, approximation algorithm, computational and structural complexity
1	Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas	Approximation Algorithms for 3D Orthogonal Knapsack.	TAMC	2007	DBLP DOI BibTeX RDF
1	Eu Jin Teoh, Cheng Xiang, Kay Chen Tan	A Fast Learning Algorithm Based on Layered Hessian Approximations and the Pseudoinverse.	ISNN	2006	DBLP DOI BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	FCT	2005	DBLP DOI BibTeX RDF
1	Birgit Schelm	Average-Case Non-approximability of Optimisation Problems.	FCT	2005	DBLP DOI BibTeX RDF
1	Qi Cheng	On the Ultimate Complexity of Factorials.	STACS	2003	DBLP DOI BibTeX RDF
1	Lance Fortnow, Sophie Laplante	Nearly Optimal Language Compression Using Extractors.	STACS	1998	DBLP DOI BibTeX RDF	Topics Computational and structural complexity, Kolmogorov complexity
1	Juraj Hromkovic, Georg Schnitger	Communication Complexity and Sequential Compuation.	MFCS	1997	DBLP DOI BibTeX RDF	Las Vegas, communication complexity, automata, determinism, computational and structural complexity
1	Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger	Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations.	STACS	1997	DBLP DOI BibTeX RDF	Las Vegas, communication complexity, automata, determinism, computational and structural complexity
1	Klaus-Jörn Lange	An Unambiguous Class Possessing a Complete Set.	STACS	1997	DBLP DOI BibTeX RDF	Topics Computational and structural complexity theory
1	Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes	Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF	communication in interconnection networks, routing, parallel algorithms, graph theory, computational and structural complexity