Computer system < Computer theory < Computer vision

Facettes :

List of bibliographic references indexed by Computer theory

Number of relevant bibliographic references: 38.
[20-40] [0 - 20][0 - 38]

Ident.	Authors (with country if any)	Title
001F54 (2000)	Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne]	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
001F66 (2000)	Helmut Seidl [Allemagne] ; Bernhard Steffen [Allemagne]	Constraint-Based Inter-Procedural Analysis of Parallel Programs
002117 (1999)	Anna Bernasconi [Allemagne] ; Carsten Damm [Allemagne] ; Igor E. Shparlinski [Australie]	On the Average Sensitivity of Testing Square-Free Numbers
002119 (1999)	Helmut Seidl [Allemagne] ; Andreas Neumann [Allemagne]	On Guarding Nested Fixpoints
002120 (1999)	Carsten Damm [Allemagne] ; Ki Hang Kim [États-Unis] ; Fred Roush [États-Unis]	On Covering and Rank Problems for Boolean Matrices and Their Applications
002285 (1998)	Anna Slobodová [Allemagne]	On the composition problem for OBDDs with multiple variable orders
002287 (1998)	Stasys Jukna [Allemagne, Lituanie] ; Stanislav Žák [République tchèque]	On branching programs with bounded uncertainty
002289 (1998)	Carsten Damm [Allemagne]	On Boolean vs. Modular arithmetic for circuits and communication protocols
002298 (1998)	Andreas Neumann [Allemagne] ; Helmut Seidl [Allemagne]	Locating Matches of Tree Patterns in Forests
002348 (1998)	M. Mundhenk [Allemagne] ; A. Slobodova [Allemagne]	Optimal non-approximability of MAXCLIQUE
002455 (1997)	Klaus Jansen [Allemagne]	The optimum cost chromatic partition problem
002458 (1997)	Martin Mundhenk [Allemagne] ; Judy Goldsmith [États-Unis] ; Eric Allender [États-Unis]	The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
002472 (1997)	Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne]	On the influence of the state encoding on OBDD-representations of finite state machines
002474 (1997)	S. Jukna [Allemagne] ; A. Razborov [Russie, Cuba] ; P. Savick [République tchèque, Swaziland] ; I. Wegener [Allemagne]	On P versus NP∩co-NP for decision trees and read-once branching programs
002479 (1997)	Martin Mundhenk [Allemagne]	NP-hard sets have many hard instances
002491 (1997)	Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne]	Constrained bipartite edge coloring with applications to wavelength routing
002496 (1997)	Klaus Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
002506 (1997)	Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne]	A new approximation algorithm for the register allocation problem

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i -k "Computer theory" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "Computer theory" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    Computer theory
}}

---

This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024