Search results for "03D15"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
51	Jirí Fiala 0001, Daniël Paulusma	The Computational Complexity of the Role Assignment Problem.	ICALP	2003	DBLP DOI BibTeX RDF	role assignment 2002 Mathematics Subject Classification: 05C15, computational complexity, 03D15, graph homomorphism
51	Martin Hofmann 0001	The Strength of Non-size-increasing Computation (Introduction and Summary).	MFCS	2001	DBLP DOI BibTeX RDF	semantics AMS Classification: 03D15, 03C13, computational complexity, 68Q15, higher-order functions, finite model, 68Q55
22	Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick	Using Entanglement in Quantum Multi-Prover Interactive Proofs.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	Subject classification. 03D15, 81P68, 68Q15, 68Q10
22	Alexander A. Sherstov	Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	Subject classification. 03D15, 68Q17
22	Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans	On the Complexity of Succinct Zero-Sum Games.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	91A05, 68Q17, Subject classification. 68Q15, 03D15, 68Q32
22	Alexander A. Sherstov	Halfspace Matrices.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 03D15, 68Q17, 68Q15
22	Masahiro Kumabe, Toshio Suzuki, Takeshi Yamazaki	Does truth-table of linear norm reduce the one-query tautologies to a random oracle?	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q15, 03D15
22	Johanna N. Y. Franklin	Schnorr trivial reals: a construction.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 03D15
22	Pierre McKenzie, Klaus W. Wagner	The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	Subject classification. 68Q25, 68Q15, 03D15
22	Emil Jerábek	Complexity of admissible rules.	Arch. Math. Log.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03B45, 03D15, 03B55
22	Pascal Michel	Computational complexity of logical theories of one successor and another unary function.	Arch. Math. Log.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03D15, 03B25, 68Q17
22	Chris Pollett	Languages to diagonalize against advice classes.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	Subject classification. 68Q15, 03D15
22	Michael R. Fellows, Jens Gramm, Rolf Niedermeier	On The Parameterized Intractability Of Motif Search Problems.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03D15, 68Q17, 68Q25
22	Pascal Koiran	Valiant's model and the cost of computing integers.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15, 03D15
22	Michael J. Wooldridge, Paul E. Dunne	The complexity of agent design problems: Determinism and history dependence.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	AMS subject classification 03D15 (complexity), 68T35 (artificial intelligence)
22	Toshio Suzuki	Bounded truth table does not reduce the one-query tautologies to a random oracle.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q15, 03D15
22	John Watrous	On the complexity of simulating space-bounded quantum computations.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 03D15, 68Q15
22	Takashi Mihara, Shao Chin Sung	Deterministic polynomial-time quantum algorithms for Simon's problem.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05
22	László Babai, Thomas P. Hayes, Peter G. Kimmel	The Cost of the Missing Bit: Communication Complexity with Help.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15
22	Karl-Heinz Niggl	The m\mu-measure as a tool for classifying computational complexity.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03D15, 68Q15, 68Q42, 03D20
22	Stasys Jukna	Combinatorics of Monotone Computations.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 03D15, 05D15, 68R05, 05C65, 05B30
22	Karl-Heinz Niggl	Subrecursive functions on partial sequences.	Arch. Math. Log.	1999	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991): 03D15, 03D45, 03D65, 03D99, 68Q99, 68Q25, 68Q10, 68Q55, 68Q45, 03D20
22	Marcus Schaefer 0001	A guided tour of minimal indices and shortest descriptions.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991): 03D15, 03D35, 03D80
22	Karl-Heinz Niggl	A restricted computation model on Scott domains and its partial primitive recursive functionals.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991):03D15, 03D65, 03D99, 68Q99, 68Q15, 68Q10, 68Q55, 68Q05, 03D20